Theory of computation dfa construction

Question

$\Large L = \left \{ a^{m^n} | n \geq 1, m > n \right \}$

What is the Minimum no.of states in a DFA which accept this language

Comments

did you get what are the stings of L ?

if you get it, then 90% of your problem solved.

check this https://gateoverflow.in/242006/regular-language-identification

https://gateoverflow.in/242910/regular-grammar

Answer 1

here consider n=1 permanently and m=2,3,4,5,............ so it is set of all strings of length atleast 2....

Comments

Not length ...no.of a's precisely...dfa should have 3 states then?