Yield-languages of two-way pushdown tree automata

DOI10.1016/0020-0190(96)00048-8zbMath1004.68531OpenAlexW2046869989MaRDI QIDQ1352013

Kai Salomaa

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(96)00048-8

zbMATH Keywords

formal languagesrecursively enumerable setstree automatonpushdown automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

THE REGULARITY OF TWO-WAY NONDETERMINISTIC TREE AUTOMATA LANGUAGES

Cites Work

• Tree pushdown automata
• Alternating tree automata
• Tree transducers, L systems, and two-way machines
• Top-down tree transducers with two-way tree walking look-ahead
• On two-way tree automata
• Pushdown tree automata
• A Purely Homomorphic Characterization of Recursively Enumerable Sets
• Stack automata and compiling
• Two-way pushdown automata
• Indexed Grammars—An Extension of Context-Free Grammars

This page was built for publication: Yield-languages of two-way pushdown tree automata