A unifying approach for multistack pushdown automata
A unifying approach for multistack pushdown automata
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.
La Torre, Salvatore
ec51ffc2-65d9-414e-9dd2-f5f342979c10
Napoli, Margherita
283e44c3-187a-4bdb-a582-79dbfe18aac8
Parlato, Gennaro
c28428a0-d3f3-4551-a4b5-b79e410f4923
August 2014
La Torre, Salvatore
ec51ffc2-65d9-414e-9dd2-f5f342979c10
Napoli, Margherita
283e44c3-187a-4bdb-a582-79dbfe18aac8
Parlato, Gennaro
c28428a0-d3f3-4551-a4b5-b79e410f4923
La Torre, Salvatore, Napoli, Margherita and Parlato, Gennaro
(2014)
A unifying approach for multistack pushdown automata.
In 39th International Symposium on Mathematical Foundations of Computer Science (MFCS 2014).
vol. 8634,
18 pp
.
(doi:10.1007/978-3-662-44522-8_32).
Record type:
Conference or Workshop Item
(Paper)
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.
More information
e-pub ahead of print date: August 2014
Published date: August 2014
Venue - Dates:
39th International Symposium on Mathematical Foundations of Computer Science (MFCS 2014), Budapest, Hungary, 2014-08-25 - 2014-08-29
Organisations:
Electronic & Software Systems
Identifiers
Local EPrints ID: 365450
URI: http://eprints.soton.ac.uk/id/eprint/365450
PURE UUID: 7dcaf80a-185f-422e-a901-52dd28504bb4
Catalogue record
Date deposited: 04 Jun 2014 13:52
Last modified: 15 Mar 2024 20:42
Export record
Altmetrics
Contributors
Author:
Salvatore La Torre
Author:
Margherita Napoli
Author:
Gennaro Parlato
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics