{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:55:03Z","timestamp":1725512103572},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540792277"},{"type":"electronic","value":"9783540792284"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-79228-4_33","type":"book-chapter","created":{"date-parts":[[2008,4,29]],"date-time":"2008-04-29T05:07:56Z","timestamp":1209445676000},"page":"375-387","source":"Crossref","is-referenced-by-count":2,"title":["A Topological Study of Tilings"],"prefix":"10.1007","author":[{"given":"Gr\u00e9gory","family":"Lafitte","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Weiss","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"33_CR1","first-page":"407","volume-title":"Appendix A: \u201cTiling problems\u201d","author":"C. Allauzen","year":"1996","unstructured":"Allauzen, C., Durand, B.: The Classical Decision Problem. In: Appendix A: \u201cTiling problems\u201d, pp. 407\u2013420. Springer, Heidelberg (1996)"},{"key":"33_CR2","first-page":"1","volume":"66","author":"R. Berger","year":"1966","unstructured":"Berger, R.: The undecidability of the domino problem. Memoirs of the American Mathematical Society\u00a066, 1\u201372 (1966)","journal-title":"Memoirs of the American Mathematical Society"},{"issue":"1-3","key":"33_CR3","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1016\/S0304-3975(03)00242-1","volume":"310","author":"J. Cervelle","year":"2004","unstructured":"Cervelle, J., Durand, B.: Tilings: recursivity and regularity. Theoretical Computer Science\u00a0310(1-3), 469\u2013477 (2004)","journal-title":"Theoretical Computer Science"},{"key":"33_CR4","doi-asserted-by":"crossref","unstructured":"Culik II, K., Kari, J.: On aperiodic sets of Wang tiles. In: Foundations of Computer Science: Potential - Theory - Cognition, pp. 153\u2013162 (1997)","DOI":"10.1007\/BFb0052084"},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"Durand, B., Levin, L.A., Shen, A.: Complex tilings. In: Proceedings of the Symposium on Theory of Computing, pp. 732\u2013739 (2001)","DOI":"10.1145\/380752.380880"},{"issue":"1-2","key":"33_CR6","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S0304-3975(99)00027-4","volume":"221","author":"B. Durand","year":"1999","unstructured":"Durand, B.: Tilings and quasiperiodicity. Theoretical Computer Science\u00a0221(1-2), 61\u201375 (1999)","journal-title":"Theoretical Computer Science"},{"issue":"1-2","key":"33_CR7","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0304-3975(02)00018-X","volume":"281","author":"B. Durand","year":"2002","unstructured":"Durand, B.: De la logique aux pavages. Theoretical Computer Science\u00a0281(1-2), 311\u2013324 (2002)","journal-title":"Theoretical Computer Science"},{"key":"33_CR8","first-page":"245","volume":"28","author":"F. Gale","year":"1953","unstructured":"Gale, F., Stewart, F.M.: Infinite games with perfect information. Ann. Math. Studies\u00a028, 245\u2013266 (1953)","journal-title":"Ann. Math. Studies"},{"issue":"2","key":"33_CR9","doi-asserted-by":"publisher","first-page":"283","DOI":"10.2307\/2272640","volume":"39","author":"W.P. Hanf","year":"1974","unstructured":"Hanf, W.P.: Non-recursive tilings of the plane. I. Journal of Symbolic Logic\u00a039(2), 283\u2013285 (1974)","journal-title":"Journal of Symbolic Logic"},{"key":"33_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-3-540-70918-3_32","volume-title":"STACS 2007","author":"G. Lafitte","year":"2007","unstructured":"Lafitte, G., Weiss, M.: Universal Tilings. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol.\u00a04393, pp. 367\u2013380. Springer, Heidelberg (2007)"},{"key":"33_CR11","doi-asserted-by":"publisher","first-page":"363","DOI":"10.2307\/1971035","volume":"102","author":"D.A. Martin","year":"1975","unstructured":"Martin, D.A.: 1975. Annals of Math.\u00a0102, 363\u2013371 (1975)","journal-title":"Annals of Math."},{"issue":"2","key":"33_CR12","doi-asserted-by":"publisher","first-page":"286","DOI":"10.2307\/2272641","volume":"39","author":"D. Myers","year":"1974","unstructured":"Myers, D.: Non-recursive tilings of the plane. II. Journal of Symbolic Logic\u00a039(2), 286\u2013294 (1974)","journal-title":"Journal of Symbolic Logic"},{"key":"33_CR13","first-page":"159","volume":"39","author":"J.C. Oxtoby","year":"1957","unstructured":"Oxtoby, J.C.: Contribution to the theory of games, Vol. III. Ann. of Math. Studies\u00a039, 159\u2013163 (1957)","journal-title":"Ann. of Math. Studies"},{"key":"33_CR14","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/BF01418780","volume":"12","author":"R. Robinson","year":"1971","unstructured":"Robinson, R.: Undecidability and nonperiodicity for tilings of the plane. Inventiones Mathematicae\u00a012, 177\u2013209 (1971)","journal-title":"Inventiones Mathematicae"},{"key":"33_CR15","unstructured":"Serre, O.: Contribution \u00e1 l\u2019\u00e9tude des jeux sur des graphes de processus \u00e1 pile, PhD thesis, Universit\u00e9 Paris VII (2005)"},{"key":"33_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/j.1538-7305.1961.tb03975.x","volume":"40","author":"H. Wang","year":"1961","unstructured":"Wang, H.: Proving theorems by pattern recognition II. Bell System Technical Journal\u00a040, 1\u201341 (1961)","journal-title":"Bell System Technical Journal"},{"key":"33_CR17","unstructured":"Wang, H.: Dominoes and the \n                    \n                      \n                    \n                    $\\forall\\exists\\forall$\n                  -case of the decision problem. In: Proceedings of the Symposium on Mathematical Theory of Automata, pp. 23\u201355 (1962)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79228-4_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:14:19Z","timestamp":1619522059000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79228-4_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540792277","9783540792284"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79228-4_33","relation":{},"subject":[]}}