Home / Engineering / Theory of Computation / Question

M

Mr. Dubey • 51.17K Points
Coach

Q.) How many states are present in the minimum state finite automaton that recognizes the language represented by the regular expression (0+1)(0+1)…..N times?

(A) n+1
(B) n+2
(C) n
(D) 2n
Correct answer : Option (B) - n+2

Share

Discusssion

Login to discuss.