edited by
435 views
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
edited by

1 Answer

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....
selected by

Related questions

1 votes
1 votes
1 answer
1
sripo asked Oct 13, 2018
1,245 views
For the given GrammarS->aA|bBA->bC|aSB->aC|bSC->aB|bA Construct DFA I am getting confused in understanding how to take the final state.
0 votes
0 votes
0 answers
3
baofbuiafbi asked Nov 14, 2023
152 views
Prove the language L={(G,H)|G is a CFG, H is a DFA, and L(G)∩L(H)=∅} is undecidable.
1 votes
1 votes
1 answer
4
Overflow04 asked Oct 30, 2022
535 views
Number of 3 state DFA with designated initial state can be constructed over the alphabet $\sum$ = {0,1,2} with exactly 2 final states is$3^{8}$ B)$3^{9}$ C) $3^{10}$ D...