GATE | GATE CS 1999 | Question 4

Consider the regular expression (0+1)(0+1)… n times. The minimum state finite automaton that recognizes the language represented by this regular expression contains:
(A) n states
(B) n+1 states
(C) n+2 states
(D) None of the above


Answer: (B)

Explanation:

Quiz of this Question
Please comment below if you find anything wrong in the above post