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?

Question

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?

Accepted Answer

n+1

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?

Make the most of this question