# nielit scientists b

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

a) 16

b) 26

c) 32

d) 64
0
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

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
1
420 views
The automaton which allows transformation to a new state without consuming any input symbols : $NFA$ $DFA$ $NFA - 1$ All of the options
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
A finite automaton accepts which type of language : Type $0$ Type $1$ Type $2$ Type $3$