Scope-bounded pushdown languages

La Torre, Salvatore, Napoli, Margherita and Parlato, Gennaro (2014) Scope-bounded pushdown languages At 18th International Conference on Developments in Language Theory (DLT 2014), Russian Federation. 26 - 29 Aug 2014. 12 pp.


[img] PDF DLT14.pdf - Other
Download (300kB)


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.

Item Type: Conference or Workshop Item (Paper)
Venue - Dates: 18th International Conference on Developments in Language Theory (DLT 2014), Russian Federation, 2014-08-26 - 2014-08-29
Related URLs:
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Organisations: Electronic & Software Systems
ePrint ID: 365361
Date :
Date Event
August 2014Published
Date Deposited: 03 Jun 2014 08:27
Last Modified: 17 Apr 2017 13:43
Further Information:Google Scholar

Actions (login required)

View Item View Item