edited by
1,498 views
2 votes
2 votes
How many possible finite automata ( DFA ) are there with two states X and Y, where X is always initial state with alphabet a and b, that accepts everything?

answer is 20 or 64?
edited by

1 Answer

Best answer
1 votes
1 votes

20 is right.

 

 

 

 

selected by

Related questions

2 votes
2 votes
2 answers
3