Matches in DBpedia 2015-04 for { <http://dbpedia.org/resource/Tree_walking_automaton> ?p ?o }
Showing triples 1 to 14 of
14
with 100 triples per page.
- Tree_walking_automaton abstract "A tree walking automaton (TWA) is a type of finite automaton that deals with tree structures rather than strings. The concept was originally proposed in Aho & Ullman (1971).The following article deals with tree walking automata. For a different notion of tree automaton, closely related to regular tree languages, see branching automaton.".
- Tree_walking_automaton wikiPageExternalLink twasurvey.pdf.
- Tree_walking_automaton wikiPageID "16024502".
- Tree_walking_automaton wikiPageRevisionID "594958023".
- Tree_walking_automaton hasPhotoCollection Tree_walking_automaton.
- Tree_walking_automaton subject Category:Automata_theory.
- Tree_walking_automaton subject Category:Trees_(data_structures).
- Tree_walking_automaton comment "A tree walking automaton (TWA) is a type of finite automaton that deals with tree structures rather than strings. The concept was originally proposed in Aho & Ullman (1971).The following article deals with tree walking automata. For a different notion of tree automaton, closely related to regular tree languages, see branching automaton.".
- Tree_walking_automaton label "Tree walking automaton".
- Tree_walking_automaton sameAs m.03ql43q.
- Tree_walking_automaton sameAs Q7837653.
- Tree_walking_automaton sameAs Q7837653.
- Tree_walking_automaton wasDerivedFrom Tree_walking_automaton?oldid=594958023.
- Tree_walking_automaton isPrimaryTopicOf Tree_walking_automaton.