GATE | GATE-CS-2000 | Question 31

What can be said about a regular language L over {a} whose minimal finite state automaton has two states?
(A) L must be {aⁿ| n is odd}
(B) L must be {aⁿ| n is even}
(C) L must be {aⁿ| ³ O}
(D) Either L must be {aⁿ | n is odd}, or L must be {aⁿ | n is even}


Answer: (D)

Explanation: There are two states. When first state is final, it accepts even no. of a’s. When second state is final, it accepts odd no. of a’s.

Quiz of this Question

My Personal Notes arrow_drop_up

Save