On the determinacy problem for two-way pushdown automata

DOI10.1016/0020-0190(94)00164-2zbMath0938.68699OpenAlexW1998940662WikidataQ128118190 ScholiaQ128118190MaRDI QIDQ1342261

V. Pereyra

Publication date: 21 June 2000

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

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00164-2

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• Variations on the technique of Ďuriš and Galil
• Notes on looping deterministic two-way pushdown automata
• Two-way pushdown automata

This page was built for publication: On the determinacy problem for two-way pushdown automata