Publisher
Springer Science and Business Media LLC
Reference26 articles.
1. Hopcroft J, Motwani R, Ullman J. Introduction to automata theory, languages and computation [M]. Boston: Addison-Wesley Publishing Company, 1979.
2. Park D. Concurrency and automata on infinite sequences [J]. Theoretical Computer Science, 1981, 104: 167–183.
3. Milner R. Comunication and concurrency [M]. Upper Saddle River, NJ, USA: Prentice Hall, 1989.
4. Baeten J C M, Bergstra J A, Klop J W. Decidability of bisimulation equivalence for process generating context-free languages [J]. Journal of the Association for Computing Machinery, 1993, 40(3): 653–682.
5. Christensen S, Hüttel H, Stirling C. Bisimulation equivalence is decidable for all context-free processes [J]. Lecture Notes in Computer Science, 1992, 630: 138–147.