A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
A Robust Class of Context-Sensitive Languages
2007
22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)
We define a new class of languages defined by multi-stack automata that forms a robust subclass of context-sensitive languages, with decidable emptiness and closure under boolean operations. This class, called multi-stack visibly pushdown languages (MVPLs), is defined using multi-stack pushdown automata with two restrictions: (a) the pushdown automaton is visible, i.e. the input letter determines the operation on the stacks, and (b) any computation of the machine can be split into stages, where
doi:10.1109/lics.2007.9
dblp:conf/lics/TorreMP07
fatcat:pb5fd235x5ayffguy7wax2xwvm