Tree-stack automata

DOI10.1007/BF01201277zbMath0846.68073OpenAlexW2046505442MaRDI QIDQ4879207

Wolfgang Golubski, Wolfram-M. Lippe

Publication date: 27 May 1996

Published in: Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01201277

zbMATH Keywords

stack automatatree-stack automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Tree-walking-storage automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pushdown machines for the macro tree transducer
• High level tree transducers and iterated pushdown tree transducers
• Tree transducers, L systems, and two-way machines
• The IO- and OI-hierarchies
• Iterated stack automata and complexity classes
• On procedures as open subroutines. II
• Two-way nested stack automata are equivalent to two-way stack automata
• Checking automata and one-way stack languages
• On correct procedure parameter transmission in higher programming languages
• Pushdown tree automata
• Stack Machines and Classes of Nonnested Macro Languages
• A Grammatical Characterization of One-Way Nondeterministic Stack Languages
• Regular canonical systems
• Intercalation theorems for stack languages
• Stack automata and compiling
• Tree generating regular systems
• One-way stack automata
• Nested Stack Automata
• Mappings and grammars on trees

This page was built for publication: Tree-stack automata