Notes on looping deterministic two-way pushdown automata

DOI10.1016/0020-0190(94)90088-4zbMath0795.68138OpenAlexW2010534572WikidataQ128039952 ScholiaQ128039952MaRDI QIDQ1318758

V. Pereyra

Publication date: 5 April 1994

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

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

zbMATH Keywords

pushdown automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

On the determinacy problem for two-way pushdown automata ⋮ Unary Resolution: Characterizing Ptime

Cites Work

• Remarks on two-way automata with weak-counters
• On efficient recognition of transductions and relations
• Halting space-bounded computations
• Two-way pushdown automata
• Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
• Time and tape complexity of pushdown automaton languages
• Unnamed Item
• Unnamed Item