GATE | GATE CS 2011 | Question 42



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



My Personal Notes arrow_drop_up

Article Tags :


Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.