0 votes 0 votes $\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 Theory of Computation number-of-dfa + – Mudita asked Sep 19, 2018 edited Sep 19, 2018 by Shaik Masthan Mudita 435 views answer comment Share Follow See 1 comment See all 1 1 comment reply Shaik Masthan commented Sep 19, 2018 reply Follow Share 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 0 votes 0 votes Please log in or register to add a comment.
Best answer 0 votes 0 votes here consider n=1 permanently and m=2,3,4,5,............ so it is set of all strings of length atleast 2.... sanju77767 answered Sep 19, 2018 selected Sep 19, 2018 by Mudita sanju77767 comment Share Follow See 1 comment See all 1 1 comment reply Mudita commented Sep 19, 2018 reply Follow Share Not length ...no.of a's precisely...dfa should have 3 states then? 0 votes 0 votes Please log in or register to add a comment.