… For the two-way automata we obtain that two-way tree-stack automata have the same … -pushdown
automata and hence as two-way nested stack automata and two-way stack automata. …

… tree-stack systems to tree-stack automata. For this new model of stack automata, the so-called
tree-stack automata, we extend the linear stack to a tree-stack. During the writing-mode a …

… If the root of the tree-stack is popped, exactly one subtree is left in the store. Another …
tree-stack automaton gave up the bulky way of pushing and popping at the root of the tree-stack [5]. …

… If the root of the tree-stack is popped, exactly one subtree is left in the store. Another …
tree-stack automaton gave up the bulky way of pushing and popping at the root of the tree-stack [5]. …

… the class of languages recognized by such automata is identical to the class of … automaton,
a tree (called a tree stack) is associated with each read-head of the bottom-up tree automaton…

… In fact, even one of the additional features of the former automata, the capability to delete
or to duplicate subtrees of the tree stack increases the recognition power. Also we show that …

… the class of languages recognized by such automata is identical to the class of … automaton,
a tree (called a tree stack) is associated with each read-head of the bottom-up tree automaton…

… We introduce tree stack automata as a new class of automata with storage and identify a
restricted form of tree stack automata that recognises exactly the multiple context-free languages…

… ▶ Problem: Parsing with complicated grammars and recognition with complicated
automata are time intensive ▶ Example: multiple-context-free grammars and tree-stack …

… accepted by tree stack automata (TSA's), tree automata which resemble … tree stack with a
subtree of the input. A sub configuration will have the form where the state q and the tree stack …