Definition of a language L with alphabet {a} is given as following and n is a positive integer constant. What is the minimum number of states needed in a DFA to recognize L?
k + 1
n + 1
2n + 1
2k + 1
Correct Option: B
As n is constant atleast n + 1 states will required to design ank.
