@Unpublished{     eps351914,
  Author        = "Torre, Salvatore La and Napoli, Margherita and Parlato, Gennaro",
  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.",
  date-added    = "2014-02-24 09:17:20 +0000",
  date-modified = "2014-02-24 09:17:20 +0000",
  Month         = "April",
  Publisher     = "University of Southampton",
  Title         = "On Multi-stack Visibly Pushdown Languages",
  Type          = "Technical Report",
  URL           = "http://eprints.soton.ac.uk/351914/",
  Year          = "2013",
  bdsk-url-1    = "http://eprints.soton.ac.uk/351914/",
  File          = "On Multi-stack Visibly Pushdown Languages - Torre, Napoli, Parlato (0) (0) - a - a - j.pdf"
}

@Unpublished{ eps351914, Author = "Torre, Salvatore La and Napoli, Margherita and Parlato, Gennaro", 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.", date-added = "2014-02-24 09:17:20 +0000", date-modified = "2014-02-24 09:17:20 +0000", Month = "April", Publisher = "University of Southampton", Title = "On Multi-stack Visibly Pushdown Languages", Type = "Technical Report", URL = "http://eprints.soton.ac.uk/351914/", Year = "2013", bdsk-url-1 = "http://eprints.soton.ac.uk/351914/", File = "On Multi-stack Visibly Pushdown Languages - Torre, Napoli, Parlato (0) (0) - a - a - j.pdf" }