A Context-Free Process as a Pushdown Automaton

  • Authors:

  • J. C. Baeten;P. J. Cuijpers;P. J. Tilburg

  • Affiliations:

  • Division of Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands 5600 MB;Division of Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands 5600 MB;Division of Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands 5600 MB

  • Venue:
  • CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.