Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Infinite_tree_automaton> ?p ?o. }
Showing items 1 to 13 of
13
with 100 items 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 wikiPageRevisionID "564362252".
- Infinite_tree_automaton hasPhotoCollection Infinite_tree_automaton.
- Infinite_tree_automaton subject Category:Automata_theory.
- Infinite_tree_automaton subject Category:Trees_(data_structures).
- 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 m.09k61gj.
- 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.