Deterministic automaton - Reference.org

On this page

Deterministic automaton

Concept of automata theory in which the outcome of a transition from one state to another is determined by the input

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

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

A standard way to build a deterministic finite automaton from a nondeterministic finite automaton is the powerset construction.: 44

We don't have any images related to Deterministic automaton yet.

You can add one yourself here.

We don't have any YouTube videos related to Deterministic automaton yet.

You can add one yourself here.

We don't have any PDF documents related to Deterministic automaton yet.

You can add one yourself here.

We don't have any Books related to Deterministic automaton yet.

You can add one yourself here.

We don't have any archived web articles related to Deterministic automaton yet.

You can submit a link to a page to archive here.

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. 0-521-61324-8 ↩
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. 0-521-61324-8 ↩
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. 0-521-61324-8 ↩