Sciweavers

113 search results - page 6 / 23
» 2-Visibly Pushdown Automata
Sort
View
JAPLL
2008
95views more  JAPLL 2008»
13 years 7 months ago
A note on an extension of PDL
Recently visibly pushdown automata have been extended to so called k-phase multistack visibly pushdown automata (k-MVPAs). On the occasion of introducing kMVPAs, it has been asked...
Stefan Göller, Dirk Nowotka
MFCS
2005
Springer
14 years 28 days ago
Regular Sets of Higher-Order Pushdown Stacks
Abstract. It is a well-known result that the set of reachable stack contents in a pushdown automaton is a regular set of words. We consider the more general case of higher-order pu...
Arnaud Carayol
FOSSACS
2009
Springer
14 years 2 months ago
Realizability of Concurrent Recursive Programs
Abstract. We define and study an automata model of concurrent recursive programs. An automaton consists of a finite number of pushdown systems running in parallel and communicati...
Benedikt Bollig, Manuela-Lidia Grindei, Peter Habe...
WWW
2007
ACM
14 years 8 months ago
Visibly pushdown automata for streaming XML
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 ...
Viraj Kumar, P. Madhusudan, Mahesh Viswanathan
LICS
2008
IEEE
14 years 1 months ago
Collapsible Pushdown Automata and Recursion Schemes
Collapsible pushdown automata (CPDA) are a new kind of higher-order pushdown automata in which every symbol in the stack has a link to a stack situated somewhere below it. In addi...
Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong...