@inproceedings{f5f76e90a5e14324aa3fec17f096c6ad,
title = "A context-free process as a pushdown automaton",
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.",
author = "J.C.M. Baeten and P.J.L. Cuijpers and \{Tilburg, van\}, P.J.A.",
year = "2008",
doi = "10.1007/978-3-540-85361-9\_11",
language = "English",
isbn = "978-3-540-85360-2",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "98--113",
editor = "\{Breugel, van\}, F. and M. Chechik",
booktitle = "CONCUR 2008 - Concurrency Theory (19th International Conference, Toronto, Canada, August 19-22, 2008, Proceedings)",
address = "Germany",
}