223 search results - page 10 / 45 » Synchronization of Pushdown Automata |
CONCUR
2010
Springer
13 years 8 months ago
2010
Springer
A one-counter automaton is a pushdown automaton over a singleton stack alphabet. We prove that the bisimilarity of processes generated by nondeterministic one-counter automata (wit...
FOSSACS
2009
Springer
14 years 2 months ago
2009
Springer
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...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Abstract. We prove an n-exptime lower bound for the problem of deciding the winner in a reachability game on Higher Order Pushdown Automata (HPDA) of level n. This bound matches th...
WWW
2007
ACM
14 years 8 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 ...
ADVCS
2007
13 years 7 months ago
2007
Cellular learning automata is a combination of learning automata and cellular automata. This model is superior to cellular learning automata because of its ability to learn and als...