A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
On Removing the Pushdown Stack in Reachability Constructions
[chapter]
2001
Lecture Notes in Computer Science
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 can be accepted by a 2-tape pushdown acceptor with reversal-bounded counters. We improve this result by showing that the stack can be removed from the acceptor, i.e., the binary reachability can be accepted by a 2-tape finite-state acceptor with reversal-bounded counters. We also obtain similar results for more
doi:10.1007/3-540-45678-3_22
fatcat:pleb3eqv5bhwzlwe7mdm2lo5x4