Notes on looping deterministic two-way pushdown automata
From MaRDI portal
Publication:1318758
DOI10.1016/0020-0190(94)90088-4zbMath0795.68138OpenAlexW2010534572WikidataQ128039952 ScholiaQ128039952MaRDI QIDQ1318758
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
Related Items
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