Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Infinite_tree_automaton> ?p ?o }
Showing triples 1 to 43 of
43
with 100 triples per page.
- Infinite_tree_automaton abstract "In computer science and mathematical logic, an infinite tree automaton is a state machine that deals with infinite tree structure. It can be viewed as an extension from a finite tree automaton, which accepts only finite tree structures. It can also be viewed as an extension of some infinite word automatons such as the Büchi automaton and the Muller automaton.A finite automaton which runs on an infinite tree was first used by Rabin for proving decidability of monadic second order logic. It has been further observed that tree automaton and logical theories are closely connected and it allows decision problems in logic to be reduced into decision problems for automaton.".
- Infinite_tree_automaton wikiPageID "25436675".
- Infinite_tree_automaton wikiPageLength "5298".
- Infinite_tree_automaton wikiPageOutDegree "16".
- Infinite_tree_automaton wikiPageRevisionID "564362252".
- Infinite_tree_automaton wikiPageWikiLink Büchi_automaton.
- Infinite_tree_automaton wikiPageWikiLink Category:Automata_theory.
- Infinite_tree_automaton wikiPageWikiLink Category:Trees_(data_structures).
- Infinite_tree_automaton wikiPageWikiLink Computer_science.
- Infinite_tree_automaton wikiPageWikiLink Finite-state_machine.
- Infinite_tree_automaton wikiPageWikiLink Mathematical_logic.
- Infinite_tree_automaton wikiPageWikiLink Muller_automaton.
- Infinite_tree_automaton wikiPageWikiLink Omega_automaton.
- Infinite_tree_automaton wikiPageWikiLink Rabin_automaton.
- Infinite_tree_automaton wikiPageWikiLink Second-order_logic.
- Infinite_tree_automaton wikiPageWikiLink Second_order_logic.
- Infinite_tree_automaton wikiPageWikiLink State_machine.
- Infinite_tree_automaton wikiPageWikiLink Streett_automaton.
- Infinite_tree_automaton wikiPageWikiLink Tree_(set_theory).
- Infinite_tree_automaton wikiPageWikiLink Tree_automaton.
- Infinite_tree_automaton wikiPageWikiLink Tree_structure.
- Infinite_tree_automaton wikiPageWikiLink Ω-automaton.
- Infinite_tree_automaton wikiPageWikiLinkText "Infinite tree automaton".
- Infinite_tree_automaton wikiPageWikiLinkText "infinite tree automaton".
- Infinite_tree_automaton hasPhotoCollection Infinite_tree_automaton.
- Infinite_tree_automaton wikiPageUsesTemplate Template:Refimprove.
- Infinite_tree_automaton subject Category:Automata_theory.
- Infinite_tree_automaton subject Category:Trees_(data_structures).
- Infinite_tree_automaton hypernym Machine.
- Infinite_tree_automaton type Article.
- Infinite_tree_automaton type Software.
- Infinite_tree_automaton type Article.
- Infinite_tree_automaton type Structure.
- Infinite_tree_automaton type Technique.
- Infinite_tree_automaton comment "In computer science and mathematical logic, an infinite tree automaton is a state machine that deals with infinite tree structure. It can be viewed as an extension from a finite tree automaton, which accepts only finite tree structures. It can also be viewed as an extension of some infinite word automatons such as the Büchi automaton and the Muller automaton.A finite automaton which runs on an infinite tree was first used by Rabin for proving decidability of monadic second order logic.".
- Infinite_tree_automaton label "Infinite tree automaton".
- Infinite_tree_automaton sameAs درخت_اتومات_نامتناهی.
- Infinite_tree_automaton sameAs m.09k61gj.
- Infinite_tree_automaton sameAs Аутомат_бесконачног_стабла.
- Infinite_tree_automaton sameAs Q6029880.
- Infinite_tree_automaton sameAs Q6029880.
- Infinite_tree_automaton wasDerivedFrom Infinite_tree_automaton?oldid=564362252.
- Infinite_tree_automaton isPrimaryTopicOf Infinite_tree_automaton.