Number of states require to accept string ends with 10.
A. 3
B. 2
C. 1
D. can’t be represented.
Answer:A
Number of states require to accept string ends with 10.
A. 3 B. 2 C. 1 D. can’t be represented.
Explanation: This is minimal finite automata.