Yield-languages of two-way pushdown tree automata

DOI10.1016/0020-0190(96)00048-8MaRDI QIDQ1352013zbMATH OpenOpenAlexFDO

Authors 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 languagespushdown automatonrecursively enumerable setstree automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

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

Cited in

(1)

• THE REGULARITY OF TWO-WAY NONDETERMINISTIC TREE AUTOMATA LANGUAGES

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1352013)