A common deterministic automaton is a deterministic finite automaton (DFA)) which is a finite state machine where for each pair of state and input symbol there is one and only one transition to a next state. DFAs recognize the set of regular languages and no other languages.
- Anderson (2006) p.41
- Anderson (2006) p.52
- Anderson (2006) p.44
- Anderson, James A. (2006). Automata theory with modern applications. With contributions by Tom Head. Cambridge: Cambridge University Press. ISBN 0-521-61324-8. Zbl 1127.68049.
|P ≟ NP||This theoretical computer science–related article is a stub. You can help Wikipedia by expanding it.|