Yield-languages of two-way pushdown tree automata
From MaRDI portal
Publication:1352013
DOI10.1016/0020-0190(96)00048-8zbMath1004.68531MaRDI QIDQ1352013
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
68Q45: Formal languages and automata
Related Items
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