8 search results - page 2 / 2 » Regular Sets of Higher-Order Pushdown Stacks |
CONCUR
2008
Springer
13 years 6 months ago
2008
Springer
A well-known theorem in automata theory states that every context-free language is accepted by a pushdown automaton. We investigate this theorem in the setting of processes, using ...
IJFCS
2008
13 years 4 months ago
2008
Abstract. Recently, it has been shown that for any higher order pushdown system H and for any regular set C of configurations, the set pre H(C), is regular. In this paper, we give ...
FSTTCS
2010
Springer
13 years 2 months ago
2010
Springer
In this paper, we address the verification problem of ordered multi-pushdown systems: A multistack extension of pushdown systems that comes with a constraint on stack operations s...