Sciweavers

Share
CONCUR
2008
Springer

A Context-Free Process as a Pushdown Automaton

8 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 the rooted branching bisimulation and contrasimulation equivalences instead of language equivalence. In process theory, different from automata theory, interaction is explicit, so we realize a pushdown automaton as a regular process communicating with a stack.
Jos C. M. Baeten, Pieter J. L. Cuijpers, P. J. A.
Added 18 Oct 2010
Updated 18 Oct 2010
Type Conference
Year 2008
Where CONCUR
Authors Jos C. M. Baeten, Pieter J. L. Cuijpers, P. J. A. van Tilburg
Comments (0)
books