in Theory of Computation
678 views
1 vote
1 vote

PLease help me , i have seen the same questions in many places but didnt understand the solution .

in Theory of Computation
678 views

4 Comments

@Habibkhan here the states are not mentioned to be distinct.. so how can you distinguish between states? I have named them as per my convenience
0
0
if the initial state is designated then there will be 20 DFA's otherwise answer will be 40 as explained above.
0
0

1 Answer

0 votes
0 votes

 

 

case1:when no final state to be chosen.

    then dfa possible=2^4=16.

case2:when X is initial state and Y is final state but unreachable from X

  then dfa possible =2^2=4

therefore in total dfa possible is =16+4=20.Ans

1 comment

@Vikas202 There may be possible no final state selected 

0
0