15 search results - page 2 / 3 » Properties of Visibly Pushdown Transducers |
CSR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. While visibly pushdown languages properly generalise regular languages and are properly contained in deterministic context-free languages, the complexity of their members...
FOIKS
2008
Springer
13 years 7 months ago
2008
Springer
Visibly Pushdown Languages (VPLs), recognized by Visibly Pushdown Automata (VPAs), are a nicely behaved family of contextfree languages. It has been shown that VPAs are equivalent ...
LATA
2010
Springer
13 years 12 months ago
2010
Springer
Operator precedence languages, designated as Floyd’s Languages (FL) to honor their inventor, are a classical deterministic context-free family. FLs are known to be a boolean fami...
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 ...