Skip to content
Related Articles

Related Articles

Improve Article
Save Article
Like Article

GATE | GATE-CS-2000 | Question 31

  • Last Updated : 28 Jun, 2021

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

Attention reader! Don’t stop learning now.  Practice GATE exam well before the actual exam with the subject-wise and overall quizzes available in GATE Test Series Course.

Learn all GATE CS concepts with Free Live Classes on our youtube channel.

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!