The University of Southampton
University of Southampton Institutional Repository

Scope-Bounded Pushdown Languages

La Torre, Salvatore, Napoli, Margherita and Parlato, Gennaro (2016) Scope-Bounded Pushdown Languages International Journal of Foundations of Computer Science, 27, (2), pp. 215-233. (doi:10.1142/S0129054116400074).

Record type: Article

Abstract

We study the formal language theory of multistack pushdown 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 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 some interesting consequences, such as, the closure under complement, the decidability of universality, inclusion and equality, and the effective semilinearity of the Parikh image (Parikh’s theorem). As a further contribution, we give a logical characterization and compare the expressiveness of the scope-bounded restriction with other Mvpa classes from the literature. To the best of our knowledge, scoped Mvpa languages form the largest class of formal languages accepted by Mpa that enjoys all the above nice properties.

PDF S0129054116400074 (1).pdf - Other
Download (328kB)

More information

Accepted/In Press date: 5 December 2015
Published date: 1 February 2016
Organisations: Electronic & Software Systems

Identifiers

Local EPrints ID: 386738
URI: http://eprints.soton.ac.uk/id/eprint/386738
ISSN: 0129-0541
PURE UUID: 6fd911b5-827d-4167-b2df-753e0c19ec1c

Catalogue record

Date deposited: 30 Jan 2016 23:06
Last modified: 17 Jul 2017 19:47

Export record

Altmetrics

Contributors

Author: Salvatore La Torre
Author: Margherita Napoli
Author: Gennaro Parlato

University divisions

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

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×