Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/McNaughtons_Theorem> ?p ?o }
Showing triples 1 to 34 of
34
with 100 triples per page.
- McNaughtons_Theorem abstract "In automata theory, McNaughton's theorem refers to a theorem that asserts that the set of ω-regular languages is identical to the set of languages recognizable by deterministic Muller automata.This theorem is proven by supplying an algorithm to construct a deterministic Muller automaton for any ω-regular language and vice versa.This theorem has many important consequences.Since Büchi automata and ω-regular languages are equally expressive, the theorem implies that Büchi automata and deterministic Muller automata are equally expressive.Since complementation of deterministic Muller automata is trivial, the theorem implies that Büchi automata/ω-regular languages are closed under complementation.".
- McNaughtons_Theorem wikiPageID "28167114".
- McNaughtons_Theorem wikiPageLength "14951".
- McNaughtons_Theorem wikiPageOutDegree "17".
- McNaughtons_Theorem wikiPageRevisionID "671952484".
- McNaughtons_Theorem wikiPageWikiLink Automata_construction.
- McNaughtons_Theorem wikiPageWikiLink Automata_theory.
- McNaughtons_Theorem wikiPageWikiLink Büchi_automaton.
- McNaughtons_Theorem wikiPageWikiLink Category:Automata_theory.
- McNaughtons_Theorem wikiPageWikiLink DFA_minimization.
- McNaughtons_Theorem wikiPageWikiLink Deterministic_finite_automaton.
- McNaughtons_Theorem wikiPageWikiLink Muller_automaton.
- McNaughtons_Theorem wikiPageWikiLink Omega-regular_language.
- McNaughtons_Theorem wikiPageWikiLink Omega_language.
- McNaughtons_Theorem wikiPageWikiLink Regular_language.
- McNaughtons_Theorem wikiPageWikiLink Safras_construction.
- McNaughtons_Theorem wikiPageWikiLink Semi-deterministic_Büchi_automaton.
- McNaughtons_Theorem wikiPageWikiLink W.l.o.g..
- McNaughtons_Theorem wikiPageWikiLink Without_loss_of_generality.
- McNaughtons_Theorem wikiPageWikiLink Ω-language.
- McNaughtons_Theorem wikiPageWikiLink Ω-regular_language.
- McNaughtons_Theorem wikiPageWikiLinkText "McNaughton's Theorem".
- McNaughtons_Theorem hasPhotoCollection McNaughtons_Theorem.
- McNaughtons_Theorem wikiPageUsesTemplate Template:Citation_needed.
- McNaughtons_Theorem wikiPageUsesTemplate Template:Refimprove.
- McNaughtons_Theorem subject Category:Automata_theory.
- McNaughtons_Theorem comment "In automata theory, McNaughton's theorem refers to a theorem that asserts that the set of ω-regular languages is identical to the set of languages recognizable by deterministic Muller automata.This theorem is proven by supplying an algorithm to construct a deterministic Muller automaton for any ω-regular language and vice versa.This theorem has many important consequences.Since Büchi automata and ω-regular languages are equally expressive, the theorem implies that Büchi automata and deterministic Muller automata are equally expressive.Since complementation of deterministic Muller automata is trivial, the theorem implies that Büchi automata/ω-regular languages are closed under complementation.".
- McNaughtons_Theorem label "McNaughton's Theorem".
- McNaughtons_Theorem sameAs Teorema_de_McNaughton.
- McNaughtons_Theorem sameAs m.0cmdmyp.
- McNaughtons_Theorem sameAs Q6802493.
- McNaughtons_Theorem sameAs Q6802493.
- McNaughtons_Theorem wasDerivedFrom McNaughtons_Theoremoldid=671952484.
- McNaughtons_Theorem isPrimaryTopicOf McNaughtons_Theorem.