Skip to content
Related Articles
Get the best out of our app
GFG App
Open App
geeksforgeeks
Browser
Continue

Related Articles

GATE | GATE-CS-2000 | Question 31

Improve Article
Save Article
Like Article
Improve Article
Save Article
Like Article

What can be said about a regular language L over {a} whose minimal finite state automaton has two states?
(A) L must be {an| n is odd}
(B) L must be {an| n is even}
(C) L must be {an| ³ O}
(D) Either L must be {an | n is odd}, or L must be {an | 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
Last Updated : 28 Jun, 2021
Like Article
Save Article
Similar Reads