Bounded phase multi-stack pushdown systems (mpds) have been studied recently. Given a set C of configurations of a mpds M, let pre* M(C, k) be the set of configurations of M from which M can reach an element of C in at most k phases. In this paper, we show that for any mpds M, any regular set C of configurations of M and any number k, the set pre*M(C, k), is regular. We use saturation like method to construct a non-deterministic finite multi-automaton recognizing pre*M(C, k). Size of the automaton constructed is double exponential in k which is optimal as the worst case complexity measure. © 2010 Springer-Verlag.
CITATION STYLE
Seth, A. (2010). Global reachability in bounded phase multi-stack pushdown systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6174 LNCS, pp. 615–628). https://doi.org/10.1007/978-3-642-14295-6_53
Mendeley helps you to discover research relevant for your work.