Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. Chandra, A.K., Kozen, D.C., Stockmeyer, L.J.: Alternation. Journal of the Association for Computing Machinery 28(1), 114–133 (1981)
2. Immerman, N.: Descriptive Complexity, pp. 53–54. Springer, Heidelberg (1998)
3. Jančar, P.: Nonprimitive recursive complexity and undecidability for petri net equivalences. Theoretical Computer Science 256, 23–30 (2001)
4. Jategaonkar, L., Meyer, A.R.: Deciding true concurrency equivalences on safe, finite nets. Theoretical Computer Science 154(1), 107–143 (1996)
5. Lecture Notes in Computer Science;F. Laroussinie,2000
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献