@inbook{0ae8942cd6d84deb9dbbdc56db2c59ee,
title = "Simulation of two-way pushdown automata revisited",
abstract = "Dedicated to David A. Schmidt on the Occasion of his 60th Birthday The linear-time simulation of 2-way deterministic pushdown automata (2DPDA) by the Cook and Jones constructions is revisited. Following the semantics-based approach by Jones, an interpreter is given which, when extended with random-access memory, performs a linear-time simulation of 2DPDA. The recursive interpreter works without the dump list of the original constructions, which makes Cook's insight into linear-time simulation of exponential-time automata more intuitive and the complexity argument clearer. The simulation is then extended to 2-way nondeterministic pushdown automata (2NPDA) to provide for a cubic-time recognition of context-free languages. The time required to run the final construction depends on the degree of nondeterminism. The key mechanism that enables the polynomial-time simulations is the sharing of computations by memoization.",
author = "Robert Gl{\"u}ck",
year = "2013",
doi = "10.4204/EPTCS.129.15",
language = "English",
volume = "129",
series = "Electronic Proceedings in Theoretical Computer Science",
publisher = "Open Publishing Association",
pages = "250--258",
editor = "Anindya Banerjee and Olivier Danvy and Kyung-Goo Doh and John Hatcliff",
booktitle = "Semantics, abstract interpretation, and reasoning about programs",
}