Jump to content

Deterministic automaton

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by RobinK (talk | contribs) at 01:50, 26 August 2009. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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

In computer science, it is referred to as deterministic computation. An example is a deterministic finite state machine 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.

P ≟ NP 

This theoretical computer science–related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Deterministic_automaton&oldid=310082149"