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

In automata theory, complementation of a Büchi automaton is construction of another Büchi automaton that recognizes complement of the ω-regular language recognized by the given Büchi automaton. Existence of algorithms for this construction proves that the set of ω-regular languages and Büchi automata are closed under complementation.

Property Value
dbo:abstract
  • In automata theory, complementation of a Büchi automaton is construction of another Büchi automaton that recognizes complement of the ω-regular language recognized by the given Büchi automaton. Existence of algorithms for this construction proves that the set of ω-regular languages and Büchi automata are closed under complementation. This construction is particularly hard relative to the constructions for the other closure properties of Büchi automata. The first construction was presented by Büchi in 1962. Later, other constructions were developed that enabled efficient and optimal complementation. (en)
dbo:wikiPageID
  • 31683785 (xsd:integer)
dbo:wikiPageLength
  • 8629 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1028566250 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
gold:hypernym
rdf:type
rdfs:comment
  • In automata theory, complementation of a Büchi automaton is construction of another Büchi automaton that recognizes complement of the ω-regular language recognized by the given Büchi automaton. Existence of algorithms for this construction proves that the set of ω-regular languages and Büchi automata are closed under complementation. (en)
rdfs:label
  • Complementation of Büchi automaton (en)
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