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 from a stack S only if it was pushed within the last k contexts of S, for a given k (in… (More)


1 Figure or Table

Slides referencing similar topics