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

Quiz of this Question

Recommended Posts:

0 Average Difficulty : 0/5.0
No votes yet.