A unifying approach for multistack pushdown automata


La Torre, Salvatore, Napoli, Margherita and Parlato, Gennaro (2014) A unifying approach for multistack pushdown automata At 39th International Symposium on Mathematical Foundations of Computer Science (MFCS 2014), Hungary. 25 - 29 Aug 2014. 18 pp.

Download

[img] PDF MFCS14.pdf - Other
Download (274kB)

Description/Abstract

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.

Item Type: Conference or Workshop Item (Paper)
Venue - Dates: 39th International Symposium on Mathematical Foundations of Computer Science (MFCS 2014), Hungary, 2014-08-25 - 2014-08-29
Related URLs:
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Organisations: Electronic & Software Systems
ePrint ID: 365450
Date :
Date Event
August 2014Published
Date Deposited: 04 Jun 2014 13:52
Last Modified: 23 Feb 2017 00:18
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/365450

Actions (login required)

View Item View Item