Deterministic automaton
 | It has been suggested that this article be merged with Deterministic computation. (Discuss) Proposed since December 2006. |
Deterministic automaton are a concept of automata theory in which the outcome of a transition from one state to another given a certain input can be predicted for every occurrence.
A common deterministic automaton is a deterministic finite state machine (sometimes referred to as 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.
 | This computer science article is a stub. You can help Wikipedia by expanding it. |