A note on linear time simulation of deterministic two-way pushdown automata
From MaRDI portal
Publication:1245694
DOI10.1016/0020-0190(77)90022-9zbMath0375.68025OpenAlexW2007844943WikidataQ108435907 ScholiaQ108435907MaRDI QIDQ1245694
Publication date: 1977
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(77)90022-9
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Algorithms in computer science (68W99)
Related Items (4)
Maximally-Polyvariant Partial Evaluation in Polynomial Time ⋮ Generalizing Cook's transformation to imperative stack programs ⋮ Partial memoization for obtaining linear time behavior of a 2DPDA ⋮ A Practical Simulation Result for Two-Way Pushdown Automata
Cites Work
This page was built for publication: A note on linear time simulation of deterministic two-way pushdown automata
