search
Log In
0 votes
108 views
$\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
in Theory of Computation
edited by
108 views
0

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

1 Answer

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

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

Related questions

1 vote
1 answer
1
470 views
For the given Grammar S->aA|bB A->bC|aS B->aC|bS C->aB|bA Construct DFA I am getting confused in understanding how to take the final state.
asked Oct 13, 2018 in Theory of Computation sripo 470 views
2 votes
3 answers
2
592 views
How many $2$ state DFA’s with the designated initial state can be constructed over the alphabet over the alphabet $\sum = \{a, b\}$ that accept universal language? $4$ $16$ $20$ $24$
asked May 22, 2019 in Theory of Computation Hirak 592 views
0 votes
1 answer
3
1.1k views
Number of states for DFA which is divisble by 8 , I mostly try to identify by using number of distinct states. In this case , it would be 8 ; but minimized dfa would be less ? I read somewhere , the unique states sould be 4 and so minimum states are 4. Can't ... exceprt now , but is this right ? And can someone explain , what is meant by unique states ? Do we have fixed formula for such problems ?
asked Dec 7, 2016 in Theory of Computation vishal8492 1.1k views
1 vote
2 answers
4
511 views
Let $q_0$ and $q_1$ be two states, with $q_0$ always being the initial state. Let the alphabet be $\{a, b\}$. Then, the possible number of DFA's with only these two states $q_0$ and $q_1$ is? 32 64 80 120
asked Nov 22, 2015 in Theory of Computation prathams 511 views
...