Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Baeten, J., Bergstra, J., Klop, J.: Decidability of bisimulation equivalence for processes generating context-free languages. J. ACM 40(3), 653–682 (1993)
2. Benedikt, M., Göller, S., Kiefer, S., Murawski, A.S.: Bisimilarity of pushdown automata is nonelementary. In: Proc. LICS 2013, pp. 488–498. IEEE Computer Society Press (2013)
3. Lecture Notes in Computer Science;O. Burkart,1995
4. Courcelle, B.: Recursive applicative program schemes. In: Handbook of Theoretical Computer Science, vol. B, pp. 459–492. Elsevier, MIT Press (1990)
5. Czerwiński, W., Lasota, S.: Fast equivalence-checking for normed context-free processes. In: Proc. FSTTCS 2010. LIPIcs, vol. 8. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2010)