10 search results - page 1 / 2 » On the Expressive Power of 2-Stack Visibly Pushdown Automata |
CORR
2008
Springer
13 years 5 months ago
2008
Springer
SOFSEM
2012
Springer
12 years 27 days ago
2012
Springer
Visibly Pushdown Transducers (VPT) form a subclass of pushdown transducers. In this paper, we investigate the extension of VPT with visibly pushdown look-ahead (VPTla). Their trans...
DLT
2007
13 years 6 months ago
2007
Visibly Pushdown Automata (VPA) are a special case of pushdown machines where the stack operations are driven by the input. In this paper, we consider VPA with two stacks, namely 2...
WWW
2007
ACM
14 years 6 months ago
2007
ACM
We propose the study of visibly pushdown automata (Vpa) for processing XML documents. Vpas are pushdown automata where the input determines the stack operation, and XML documents ...
ICALP
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Nested words are a restriction of the class of visibly pushdown languages that provide a natural model of runs of programs with recursive procedure calls. The usual conne...