Skip to content
Related Articles

Related Articles

Improve Article

GATE | GATE CS 2011 | Question 42

  • Last Updated : 28 Jun, 2021

Definition of a language L with alphabet {a} is given as following.

             L={gate2011Q42| k>0, and n is a positive integer constant}

What is the minimum number of states needed in DFA to recognize L?
(A) k+1
(B) n+1
(C) 2^(n+1)
(D) 2^(k+1)


Answer: (B)

Explanation: See Question 3 of https://www.geeksforgeeks.org/automata-theory-set-4/

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 :