Abstract
Bounded phase multi-stack pushdown automata have been studied recently. In this paper we show that parity games over bounded phase multi-stack pushdown systems are effectively solvable and winning strategy in these games can be effectively synthesized. We show some applications of our result, including a new proof of a known result that emptiness problem for bounded phase multi-stack automata is decidable. © Springer-Verlag Berlin Heidelberg 2009.
Cite
CITATION STYLE
Seth, A. (2009). Games on multi-stack pushdown systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5407 LNCS, pp. 395–408). https://doi.org/10.1007/978-3-540-92687-0_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
