A finite automaton is deterministic if
a. It has no transition of input E .
b. For each state s and input symbol a, there is at most one edge labeled a leaving s.