957 views

2 Answers

Best answer
3 votes
3 votes
On every state it has two inputs , so each input can go to one of the two states. So for every state its arrows (->) have four possible combinations. Similarly on second state it also has four combinations.of arrows emerging from it. So i think its 16.
selected by
0 votes
0 votes
I think if we have.

N is the number of states

S is the alphabet symbols

Then total dfa possible is (choice for initial state) * (choice for final state) *(choice for transition function)

1*1*(N^(N*S))

2^(2*2)

= 16
Answer:

Related questions