recategorized by
985 views

1 Answer

4 votes
4 votes

For n states and m input alphabets we can have the formula:

$n*n^{nm}*2^{n}$

=$n^{mn+1}*2^{n}$

In a $DFA$ there might not be a difference if start state changes- as states are unlabeled usually. In such a case, we can divide the above by number of states giving $ n^{mn}×2^{n}$ possible $DFAs$.

Given $n=2,m=2$ 

$ n^{mn}×2^{n}$

$ 2^{2*2}×2^{2}$

$16*4$

=$64$

Option D

https://gateoverflow.in/10853/how-many-dfas-exist-with-three-states-over-the-input-alphabet

Answer:

Related questions

2 votes
2 votes
4 answers
1
admin asked Mar 31, 2020
1,631 views
The automaton which allows transformation to a new state without consuming any input symbols : $NFA$$DFA$$NFA - 1$All of the options
2 votes
2 votes
3 answers
2
admin asked Mar 31, 2020
1,572 views
Complement of a $DFA$ can be obtained by :making starting state as final state.make final as a starting state.making final states non-final and non-final as final.None of...
1 votes
1 votes
4 answers
3
admin asked Mar 31, 2020
3,616 views
Concatenation Operation refers to which of the following set operations : UnionDotKleeneNone of the options
1 votes
1 votes
2 answers
4