GATE | GATE CS 2011 | Question 42

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

             L={|ank|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⁽ⁿ⁺¹⁾

(D)

2

Answer: (B)

Explanation:

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

Quiz of this Question
Please comment below if you find anything wrong in the above post

My Personal Notes arrow_drop_up

Save