Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. Lecture Notes in Computer Science;L. Aceto,2001
2. Lecture Notes in Computer Science;R. Alur,2004
3. Lecture Notes in Computer Science;R. Alur,2005
4. Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Proc. of STOC 2004, pp. 202–211. ACM Press, New York (2004)
5. Balcazar, J., Gabarro, J., Santha, M.: Deciding bisimilarity is P-complete. Formal Aspects of Computing 4(6A), 638–648 (1992)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献