Pushdown automata and context-free grammars in bisimulation semantics
The Turing machine models an old-fashioned computer, that does not interact with the user or with other computers, and only does batch processing. Therefore, we came up with a Reactive Turing Machine that does not have these shortcomings. In the Reactive Turing Machine, transitions have labels to give a notion of interactivity. In the resuilting transition systems, we use bisimilarity instead of language equivalence. Subsequently, we considered other classical theorems and notions from automata theory and formal languages theory. In this paper, we consider the classical theorem of the correspondence between pushdown automata and context-free grammars. By changing the process operator of sequential composition to a sequencing operator with intermediate acceptance, we get a better correspondence in our setting. We find that the missing ingredient to recover the full correspondence is the addition of a notion of state awareness.
|, , , ,|
|International Conference on Algebra and Coalgebra in Computer Science|
Baeten, J.C.M, Carissimo, C, & Luttik, S.P. (2021). Pushdown automata and context-free grammars in bisimulation semantics. In Proceedings of the Conference on Algebra and Coalgebra in Computer Science. doi:10.4230/LIPIcs