# Deterministic automaton

In computer science, a **deterministic automaton** is a concept of automata theory in which the outcome of a transition from one state to another is determined by the input.^{[1]}

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.^{[2]}

A standard way to build a deterministic finite automaton from a nondeterministic finite automaton is the powerset construction.^{[3]}

## References

- 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.

This article is issued from Wikipedia - version of the 11/19/2015. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.