30 search results - page 3 / 6 » Event-Clock Visibly Pushdown Automata |
CSR
2008
Springer
14 years 11 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...
95
Voted
DLT
2007
14 years 11 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
15 years 10 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 ...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
102
click to vote
LICS
2007
IEEE
15 years 3 months ago
2007
IEEE
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 boolea...