Deterministic automaton
In computer science, a deterministic automaton is a concept of automata theory where the outcome of a transition from one state to another is determined by the input.
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.
A standard way to build a deterministic finite automaton from a nondeterministic finite automaton is the powerset construction.
Sources and credits
This article is adapted from the Wikipedia article “Deterministic automaton”, written by its contributors and licensed under CC BY-SA 4.0. Fathomly has changed the layout, removed citation markers, navigation and maintenance notices, and adjusted punctuation. This adapted version is shared under the same license. For references, see the original article.
Fathomly is not affiliated with or endorsed by the Wikimedia Foundation. Spotted a problem? Tell us.