PLease help me , i have seen the same questions in many places but didnt understand the solution .
Here are few explainations:
https://gateoverflow.in/15855/calculate-number-dfas-possible-with-designated-initial-state
https://gateoverflow.in/10853/how-many-dfas-exist-with-three-states-over-the-input-alphabet
https://gateoverflow.in/27730/number-of-dfa
https://gateoverflow.in/16808/many-state-drawn-over-alphabet-which-accepts-empty-language
https://gateoverflow.in/61876/minimum-number-of-states-in-dfa
https://gateoverflow.in/11767/the-possible-no-of-dfa-with-three-states
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
@Vikas202 There may be possible no final state selected
64.3k questions
77.9k answers
244k comments
80.0k users