The number of states in the minimal deterministic finite

Home » Theory of Computation » Theory of computation miscellaneous » Question

The number of states in the minimal deterministic finite automata corresponding to the regular expression (0 + 1) * (10) is _______.

1. 0
2. 5
3. 3
4. 1

Correct Option: C

(0 +1)*10

K total minimum DFA states = 3