Deterministic automaton

Deterministic automaton is 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.

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.

The standard way to build a deterministic finite state machine from a nondeterministic finite state machine is the powerset construction.

P ≟ NP

This theoretical computer science-related article is a stub. You can help Wikipedia by expanding it.v · Categories: Automata theory Theoretical computer science stubs Wikimedia Foundation. 2010. Игры ⚽ Нужен реферат? Fulbourn Hospital Wetnfix Look at other dictionaries: deterministic automaton — determinuotasis automatas statusas T sritis automatika atitikmenys: angl. deterministic automaton vok. bestimmter Automat, m; determinierter Automat, m rus. детерминированный автомат, m pranc. automate déterminé, m …   Automatikos terminų žodynas Deterministic pushdown automaton — In automata theory, a pushdown automaton is a finite automaton with an additional stack of symbols; its transitions can take the top symbol on the stack and depend on its value, and they can add new top symbols to the stack. A deterministic… …   Wikipedia Deterministic finite-state machine — An example of a Deterministic Finite Automaton that accepts only binary numbers that are multiples of 3. The state S0 is both the start state and an accept state. In the theory of computation and automata theory, a deterministic finite state… …   Wikipedia Deterministic context-free language — A deterministic context free language is a formal language which is defined by a deterministic context free grammar.[1] The set of deterministic context free languages is called DCFL[2] and is identical to the set of languages accepted by a… …   Wikipedia Deterministic context-free grammar — In formal grammar theory, the deterministic context free grammars (DCFGs) are a proper subset of the context free grammars. The deterministic context free grammars are those a deterministic pushdown automaton can recognize. A DCFG is the finite… …   Wikipedia Deterministic algorithm — In computer science, a deterministic algorithm is an algorithm which, in informal terms, behaves predictably. Given a particular input, it will always produce the same output, and the underlying machine will always pass through the same sequence… …   Wikipedia Tree automaton — A tree automaton is a type of state machine. Tree automata deal with tree structures, rather than the strings of more conventional state machines. The following article deals with branching tree automata, which correspond to regular languages of… …   Wikipedia Probabilistic automaton — In mathematics and computer science, the probabilistic automaton (PA) is a generalization of the non deterministic finite automaton; it includes the probability of a given transition into the transition function, turning it into a transition… …   Wikipedia Büchi automaton — A Büchi automaton is the extension of a finite state automaton to infinite inputs. It accepts an infinite input sequence iff there exists a run of the automaton (in case of a deterministic automaton, there is exactly one possible run) which… …   Wikipedia Determinization of Automaton — In theoretical computer science and automata theory, determinizing a non deterministic automaton is a very important procedure. This procedure accepts a non deterministic automaton of some type and returns another deterministic automaton that… …   Wikipedia 18+ © Academic, 2000-2024 Contact us: Technical Support, Advertising Dictionaries export, created on PHP, Joomla, Drupal, WordPress, MODx. Mark and share Search through all dictionaries Translate… Search Internet Share the article and excerpts Direct link … Do a right-click on the link above and select “Copy Link”