We give a general approach to show the closure under complement and decide the emptiness for many classes of multistack visibly pushdown automata (Mvpa). A central notion in our approach is the visibly path-tree, i.e., a stack tree with the encoding of a path that denotes a linear ordering of the nodes. We show that the set of all such trees with a bounded size labeling is regular, and path-trees allow us to design simple conversions between tree automata and Mvpa's. As corollaries of our results we get the closure under complement of ordered Mvpa that was an open problem, and a better upper bound on the algorithm to check the emptiness of bounded-phase Mvpa's. © 2014 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
La Torre, S., Napoli, M., & Parlato, G. (2014). A unifying approach for multistack pushdown automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8634 LNCS, pp. 377–389). Springer Verlag. https://doi.org/10.1007/978-3-662-44522-8_32
Mendeley helps you to discover research relevant for your work.