Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q5156431> ?p ?o }
Showing triples 1 to 13 of
13
with 100 triples per page.
- Q5156431 subject Q7036095.
- Q5156431 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.".
- Q5156431 wikiPageWikiLink Q1020380.
- Q5156431 wikiPageWikiLink Q214526.
- Q5156431 wikiPageWikiLink Q309558.
- Q5156431 wikiPageWikiLink Q4720939.
- Q5156431 wikiPageWikiLink Q4826392.
- Q5156431 wikiPageWikiLink Q617295.
- Q5156431 wikiPageWikiLink Q7036095.
- Q5156431 wikiPageWikiLink Q752532.
- Q5156431 wikiPageWikiLink Q918099.
- Q5156431 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.This construction is particularly hard relative to the constructions for the other closure properties of Büchi automata.".
- Q5156431 label "Complementation of Büchi automaton".