2 search results - page 1 / 1 » On Removing the Pushdown Stack in Reachability Constructions |
ISAAC
2001
Springer
13 years 10 months ago
2001
Springer
A discrete pushdown timed automaton is a pushdown machine with integer-valued clocks. It has been shown recently that the binary reachability of a discrete pushdown timed automaton...
BIRTHDAY
1994
Springer
13 years 9 months ago
1994
Springer
Cook's construction from 1971 [4] shows that any two-way deterministic pushdown automaton (2DPDA) can be simulated in time O(n), where n is the length of its input string, and...