Reference27 articles.
1. Balcázar, J., J. Díaz, and J. Gabarró, Structural Complexity I, EATCS Monographs on Theoretical Computer Science vol. 11, Springer-Verlag, Berlin, 1995. Zbl 0638.68040 MR 91f:68058
2. Ben-Ari, M., J. Halpern, and A. Pnueli, “Deterministic propositional dynamic logic: finite models, complexity and completeness,” Journal of Computer and System Sciences, vol. 25 (1982), pp. 402–417. Zbl 0512.03013 MR 84c:03033
3. Berger, R., “The undecidability of the dominoe problem,” Memoirs of the American Mathematical Society, vol. 66 (1966). MR 36:49
4. Blackburn, P., and E. Spaan, “A modal perspective on the computational complexity of attribute value grammar,” Journal of Logic, Language and Information, vol. 2 (1993), pp. 129–169. Zbl 0793.03018 MR 95f:03040
5. Emerson, E., and J. Halpern, “Decision procedures and expressiveness in the temporal logic of branching time,” Journal of Computer and System Sciences, vol. 30 (1985), pp. 194–211. Zbl 0559.68051 MR 86j:68080
Cited by
41 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献