Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Semi-deterministic_Büchi_automaton> ?p ?o }
Showing triples 1 to 24 of
24
with 100 triples per page.
- Semi-deterministic_Büchi_automaton abstract "In automata theory, a semi-deterministic Büchi automaton is a special type of Büchi automaton. In such an automaton, states can be divided into two partitions such that one part forms a deterministic automaton and this part also contains all the accepting states.For every Büchi automaton, a semi-deterministic Büchi automaton can be constructed such that both recognize the same ω-language. But, a deterministic Büchi automaton may not exist for the same ω-language.".
- Semi-deterministic_Büchi_automaton wikiPageID "28672927".
- Semi-deterministic_Büchi_automaton wikiPageLength "8470".
- Semi-deterministic_Büchi_automaton wikiPageOutDegree "9".
- Semi-deterministic_Büchi_automaton wikiPageRevisionID "578417043".
- Semi-deterministic_Büchi_automaton wikiPageWikiLink Automata_construction.
- Semi-deterministic_Büchi_automaton wikiPageWikiLink Automata_theory.
- Semi-deterministic_Büchi_automaton wikiPageWikiLink Büchi_automaton.
- Semi-deterministic_Büchi_automaton wikiPageWikiLink Category:Automata_theory.
- Semi-deterministic_Büchi_automaton wikiPageWikiLink Kxc3xb6nigs_lemma.
- Semi-deterministic_Büchi_automaton wikiPageWikiLink Omega_language.
- Semi-deterministic_Büchi_automaton wikiPageWikiLink Power_set.
- Semi-deterministic_Büchi_automaton wikiPageWikiLink Ω-language.
- Semi-deterministic_Büchi_automaton wikiPageWikiLinkText "Semi-deterministic Büchi automaton".
- Semi-deterministic_Büchi_automaton wikiPageWikiLinkText "semi-deterministic Büchi automata".
- Semi-deterministic_Büchi_automaton hasPhotoCollection Semi-deterministic_Büchi_automaton.
- Semi-deterministic_Büchi_automaton subject Category:Automata_theory.
- Semi-deterministic_Büchi_automaton comment "In automata theory, a semi-deterministic Büchi automaton is a special type of Büchi automaton. In such an automaton, states can be divided into two partitions such that one part forms a deterministic automaton and this part also contains all the accepting states.For every Büchi automaton, a semi-deterministic Büchi automaton can be constructed such that both recognize the same ω-language. But, a deterministic Büchi automaton may not exist for the same ω-language.".
- Semi-deterministic_Büchi_automaton label "Semi-deterministic Büchi automaton".
- Semi-deterministic_Büchi_automaton sameAs m.0cz804b.
- Semi-deterministic_Büchi_automaton sameAs Q7449293.
- Semi-deterministic_Büchi_automaton sameAs Q7449293.
- Semi-deterministic_Büchi_automaton wasDerivedFrom Semi-deterministic_Büchi_automaton?oldid=578417043.
- Semi-deterministic_Büchi_automaton isPrimaryTopicOf Semi-deterministic_Büchi_automaton.