Tree pushdown automata (Q1058866): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 00:41, 31 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Tree pushdown automata |
scientific article |
Statements
Tree pushdown automata (English)
0 references
1985
0 references
The paper presents a new type of automata called tree pushdown automata. This type of automata operates in the same manner as standard bottom-up tree automata except that there is an internal memory consisting of a finite sequence of trees (called tree stack), where there is exactly one tree stack for each read head in a bottom-up tree automaton. The main result of the paper is: The class of context-free tree languages is identical with the class of languages accepted by tree pushdown automata. The method shown resemble the methods used to show the equivalence between context-free string grammars and pushdown automata. Some directions of future research are presented at the end of the paper.
0 references
tree pushdown automata
0 references
context-free tree languages
0 references