Q. Definition of a language L with alphabet {a} is given as following. L= { a^{nk} | k > 0, and n is a positive integer constant} What is the minimum number of states needed in a DFA to recognize L? (Solved)
1. k+1
2. n+1
3. 2^(n+1)
4. 2^(k+1)
- b. n+1