Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science,Computational Theory and Mathematics,Theoretical Computer Science
Reference25 articles.
1. Berger, R. The undecidability of the domino problem.Mem. Amer. Math. Soc., 66, 1966.
2. Chandra, A., Kozen, D., and Stockmeyer, L. Alternation.J. Assoc. Comput. Mach., 28:114?133, 1981.
3. Chlebus, B. Domino-tiling games.J. Comput. System Sci., 32:374?392, 1986.
4. Chlebus, B. Proving NP-completeness using bounded tiling.J. Inform. Process. Cybernet. EIK, 8:479?484, 1987.
5. Fischer, M., and Ladner, R. Prepositional dynamic logic of regular programs.J. Comput. System Sci., 18:194?211, 1979.