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]


  1. Anderson (2006) p.41
  2. Anderson (2006) p.52
  3. Anderson (2006) p.44

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.