Is it true that for all DFA that if $A$ is an accepting state and $B$ is not, that $B$ is always distinguishable from $A$.I don't think it's true, just because I think I can create a DFA.$B$ reads b ->$A$$A$ reads b -> $A$If you start at $B$ while reading a b and at $A$ you read a b you end up in the accepting state $A$. Now is there an algorithm to see if my construction is valid?
Are accepting states and unaccepting states distinguishable?
automata;finite automata