GATE | GATE-CS-2015 (Set 2) | Question 65

The number of states in the minimal deterministic finite automaton corresponding to the regular expression (0 + 1)*(10) is ____________
(A) 2
(B) 3
(C) 4
(D) 5


Answer: (B)

Explanation: Below is NFA for the given regular expression (0 + 1)*(10)

Q63


Quiz of this Question



My Personal Notes arrow_drop_up