Problem Detail: 
That’s my question, since it has two symbols but go to a single state, is DFA or NFA?
That’s my question, since it has two symbols but go to a single state, is DFA or NFA?
Asked By : Teo
Answered By : Yuval Filmus
First of all, every deterministic finite automaton is a fortiori a non-deterministic finite automaton. An finite automaton is deterministic if there are no $epsilon$ moves, and for each state $s$ and alphabet symbol $alpha$ there is a unique outgoing edge at $s$ labeled $alpha$. If a finite automaton satisfies this condition, then it you can think of it both as a DFA and as an NFA. If it doesn’t satisfy this condition, it is an NFA.
Best Answer from StackOverflow
Question Source : http://cs.stackexchange.com/questions/42074
