About: Deterministic automaton

An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

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. 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. A standard way to build a deterministic finite automaton from a nondeterministic finite automaton is the powerset construction.

Property Value
dbo:abstract
  • 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. 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. A standard way to build a deterministic finite automaton from a nondeterministic finite automaton is the powerset construction. (en)
  • Автомат детермінований — абстрактний автомат, функція переходу якого є всюди визначена (однозначна) функція Ψ: Q × X → Q, де Q — множина станів, і X множина вхідних літер (вхідна абетка). (uk)
dbo:wikiPageID
  • 3934722 (xsd:integer)
dbo:wikiPageLength
  • 1152 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1047262023 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
gold:hypernym
rdfs:comment
  • 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. 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. A standard way to build a deterministic finite automaton from a nondeterministic finite automaton is the powerset construction. (en)
  • Автомат детермінований — абстрактний автомат, функція переходу якого є всюди визначена (однозначна) функція Ψ: Q × X → Q, де Q — множина станів, і X множина вхідних літер (вхідна абетка). (uk)
rdfs:label
  • Deterministic automaton (en)
  • Детермінований автомат (uk)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License