Scope-bounded pushdown languages
Scope-bounded pushdown languages
We study the formal language theory of multistack push-down automata (Mpa) restricted to computations where a symbol can be popped from a stack S only if it was pushed within a bounded number of contexts of S (scoped Mpa). We contribute to show that scoped Mpa are indeed a robust model of computation, by focusing on the corresponding theory of visibly Mpa (Mvpa). We prove the equivalence of the deterministic and nondeterministic versions and show that scope-bounded computations of an n-stack Mvpa can be simulated, rearranging the input word, by using only one stack. These results have several interesting consequences, such as, the closure under complement, the decidability of universality, inclusion and equality, and a Parikh theorem. We also give a logical characterization and compare the expressiveness of the scope-bounded restriction with Mvpa classes from the literature.
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)
Scope-bounded pushdown languages.
In 18th International Conference on Developments in Language Theory (DLT 2014).
vol. 8633,
12 pp
.
(doi:10.1007/978-3-319-09698-8_11).
Record type:
Conference or Workshop Item
(Paper)
Abstract
We study the formal language theory of multistack push-down automata (Mpa) restricted to computations where a symbol can be popped from a stack S only if it was pushed within a bounded number of contexts of S (scoped Mpa). We contribute to show that scoped Mpa are indeed a robust model of computation, by focusing on the corresponding theory of visibly Mpa (Mvpa). We prove the equivalence of the deterministic and nondeterministic versions and show that scope-bounded computations of an n-stack Mvpa can be simulated, rearranging the input word, by using only one stack. These results have several interesting consequences, such as, the closure under complement, the decidability of universality, inclusion and equality, and a Parikh theorem. We also give a logical characterization and compare the expressiveness of the scope-bounded restriction with Mvpa classes from the literature.
More information
e-pub ahead of print date: August 2014
Published date: August 2014
Venue - Dates:
18th International Conference on Developments in Language Theory (DLT 2014), Ekaterinburg, Russian Federation, 2014-08-26 - 2014-08-29
Organisations:
Electronic & Software Systems
Identifiers
Local EPrints ID: 365361
URI: http://eprints.soton.ac.uk/id/eprint/365361
PURE UUID: 3c3a5157-c790-49d1-aced-b2fce345d111
Catalogue record
Date deposited: 03 Jun 2014 08:27
Last modified: 15 Mar 2024 20:41
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