Open In App

GATE | GATE-CS-2000 | Question 31

Last Updated : 28 Jun, 2021
Like Article
Like
Save
Share
Report

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


Like Article
Suggest improvement
Previous
Next
Share your thoughts in the comments

Similar Reads