0 votes 0 votes how many Dfa's exists with two states over input alphabet {0,1}? a) 16 b) 26 c) 32 d) 64 Theory of Computation theory-of-computation finite-automata + – shashank joshi asked Nov 22, 2018 shashank joshi 657 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply kumar.dilip commented Nov 22, 2018 reply Follow Share See here. https://gateoverflow.in/10853/how-many-dfas-exist-with-three-states-over-the-input-alphabet 0 votes 0 votes manisha11 commented Nov 23, 2018 reply Follow Share 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 0 votes 0 votes tusharp commented Nov 23, 2018 reply Follow Share @manisha11 you are correct. Add it as answer. 1 votes 1 votes Please log in or register to add a comment.
2 votes 2 votes 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 manisha11 answered Nov 23, 2018 manisha11 comment Share Follow See all 0 reply Please log in or register to add a comment.
