Tilings: Recursivity and Regularity
暂无分享,去创建一个
[1] Yuri Gurevich,et al. Average Case Completeness , 1991, J. Comput. Syst. Sci..
[2] Y. Gurevich,et al. Remarks on Berger's paper on the domino problem , 1972 .
[3] Bruno Durand,et al. Tilings and Quasiperiodicity , 1997, Theor. Comput. Sci..
[4] Jarkko Kari. Rice's Theorem for the Limit Sets of Cellular Automata , 1994, Theor. Comput. Sci..
[5] Yuri Gurevich,et al. The Classical Decision Problem , 1997, Perspectives in Mathematical Logic.
[6] R. Robinson. Undecidability and nonperiodicity for tilings of the plane , 1971 .
[7] Robert L. Berger. The undecidability of the domino problem , 1966 .
[8] Kevin Ingersent. Matching Rules for Quasicrystalline Tilings , 1991 .
[9] Bruno Durand. A Random NP-Complete Problem for Inversion of 2D Cellular Automata , 1995, STACS.
[10] Bruno Durand. The Surjectivity Problem for 2D Cellular Automata , 1994, J. Comput. Syst. Sci..
[11] Hao Wang. Proving theorems by pattern recognition — II , 1961 .
[12] Hao Wang,et al. Proving theorems by pattern recognition I , 1960, Commun. ACM.
[13] Bruno Durand. Inversion of 2D Cellular Automata: Some Complexity Results , 1994, Theor. Comput. Sci..
[14] Bruno Durand. Tilings and Quasiperiodicity , 1999, Theor. Comput. Sci..
[15] Leonid A. Levin,et al. Average Case Complete Problems , 1986, SIAM J. Comput..
[16] Jarkko Kari,et al. Reversibility and Surjectivity Problems of Cellular Automata , 1994, J. Comput. Syst. Sci..