Sciweavers

9 search results - page 1 / 2
» A Context-Free Process as a Pushdown Automaton
Sort
View
CONCUR
2008
Springer
13 years 5 months ago
A Context-Free Process as a Pushdown Automaton
A well-known theorem in automata theory states that every context-free language is accepted by a pushdown automaton. We investigate this theorem in the setting of processes, using ...
Jos C. M. Baeten, Pieter J. L. Cuijpers, P. J. A. ...
WOLLIC
2010
Springer
13 years 2 months ago
Mechanisation of PDA and Grammar Equivalence for Context-Free Languages
We provide a formalisation of the theory of pushdown automata (PDAs) using the HOL4 theorem prover. It illustrates how provers such as HOL can be used for mechanising complicated p...
Aditi Barthwal, Michael Norrish
CONCUR
2010
Springer
13 years 4 months ago
Bisimilarity of One-Counter Processes Is PSPACE-Complete
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...
Stanislav Böhm, Stefan Göller, Petr Janc...
LICS
2008
IEEE
13 years 10 months ago
Winning Regions of Higher-Order Pushdown Games
In this paper we consider parity games defined by higher-order pushdown automata. These automata generalise pushdown automata by the use of higher-order stacks, which are nested ...
Arnaud Carayol, Matthew Hague, Antoine Meyer, C.-H...
ACL
1990
13 years 4 months ago
Deterministic Left to Right Parsing of Tree Adjoining Languages
We define a set of deterministic bottom-up left to right parsers which analyze a subset of Tree Adjoining Languages. The LR parsing strategy for Context Free Grammars is extended ...
Yves Schabes, K. Vijay-Shanker