search
Log In
0 votes
236 views
how many Dfa's exists with two states over input alphabet {0,1}?

a) 16

b) 26

c) 32

d) 64
in Theory of Computation 236 views
0

64

state 1 - may act as final/initial  2

state 2 - may act as final/initial  2

each state - on input 0 can have 2 transitions  and on input 1  can have 2 transitions  = 2*2*2*2 = 16

=  2*2*16 

1

@manisha11 you are correct. Add it as answer.

1 Answer

1 vote

64

state 1 - may act as final/initial  2

state 2 - may act as final/initial  2

each state - on input 0 can have 2 transitions  and on input 1  can have 2 transitions  = 2*2*2*2 = 16

=  2*2*16 

Related questions

1 vote
4 answers
1
0 votes
3 answers
2
452 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 the options
asked Mar 31, 2020 in Theory of Computation Lakshman Patel RJIT 452 views
0 votes
3 answers
3
...