The University of Southampton
University of Southampton Institutional Repository

On Multi-stack Visibly Pushdown Languages

On Multi-stack Visibly Pushdown Languages
On Multi-stack Visibly Pushdown Languages
We contribute to the theory of formal languages of visibly multistack pushdown automata (MVPA).
First, we show closure under the main operations and decidability of the main decision problems for the class of MVPA restricted to computations where a symbol can be popped out of a stack S only if it was pushed within the last k contexts of S, for a given k (in a context only one stack can be pushed or popped). In particular, this class turns out to be determinizable. Second, we show the closure under complement of the class of languages accepted by ordered MVPA (where the limitation is that a stack can be popped only if all the lower indexed stacks are empty). This gains decidability of universality, inclusion and equivalence for this class. As a further contribution, we compare the classes of languages accepted by different models of MVPA.
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
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 (2013) On Multi-stack Visibly Pushdown Languages. 20 pp .

Record type: Conference or Workshop Item (Other)

Abstract

We contribute to the theory of formal languages of visibly multistack pushdown automata (MVPA).
First, we show closure under the main operations and decidability of the main decision problems for the class of MVPA restricted to computations where a symbol can be popped out of a stack S only if it was pushed within the last k contexts of S, for a given k (in a context only one stack can be pushed or popped). In particular, this class turns out to be determinizable. Second, we show the closure under complement of the class of languages accepted by ordered MVPA (where the limitation is that a stack can be popped only if all the lower indexed stacks are empty). This gains decidability of universality, inclusion and equivalence for this class. As a further contribution, we compare the classes of languages accepted by different models of MVPA.

Text
MVPL13.pdf - Other
Download (396kB)

More information

Published date: April 2013
Organisations: Electronic & Software Systems

Identifiers

Local EPrints ID: 351914
URI: http://eprints.soton.ac.uk/id/eprint/351914
PURE UUID: b71878c8-7322-481b-867f-a9f06532136b

Catalogue record

Date deposited: 25 Apr 2013 20:06
Last modified: 14 Mar 2024 13:45

Export record

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

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.

×