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.
| Property | Value |
|---|
| dbpedia-owl: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.
|
| dbpedia-owl:wikiPageExternalLink
| |
| dcterms:subject
| |
| rdfs: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.
|
| rdfs:label
| |
| owl:sameAs
| |
| foaf:page
| |
| is owl:sameAs
of | |
| is foaf:primaryTopic
of | |
