6 search results - page 2 / 2 » Rooted Branching Bisimulation as a Congruence |
CONCUR
2008
Springer
13 years 7 months ago
2008
Springer
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 ...