{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T09:25:29Z","timestamp":1747646729428},"reference-count":20,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3521,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2004,1]]},"DOI":"10.1016\/s0304-3975(03)00242-1","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T04:04:58Z","timestamp":1052798698000},"page":"469-477","source":"Crossref","is-referenced-by-count":9,"title":["Tilings: recursivity and regularity"],"prefix":"10.1016","volume":"310","author":[{"given":"Julien","family":"Cervelle","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bruno","family":"Durand","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(03)00242-1_BIB1","unstructured":"C. Allauzen, B. Durand, Appendix A: Tiling Problems, The Classical Decision Problem, Springer, Berlin, 1996, pp. 407\u2013420."},{"key":"10.1016\/S0304-3975(03)00242-1_BIB2","article-title":"The undecidability of the domino problem","volume":"66","author":"Berger","year":"1966","journal-title":"Mem. Amer. Math. Soc."},{"key":"10.1016\/S0304-3975(03)00242-1_BIB3","series-title":"The Classical Decision Problem","author":"B\u00f6rger","year":"1996"},{"key":"10.1016\/S0304-3975(03)00242-1_BIB4","doi-asserted-by":"crossref","unstructured":"J. Cervelle, B. Durand, Tilings: recursivity and regularity, in: STACS\u201900, Lecture Notes in Computer Science, Vol. 1770, Springer, Berlin, 2000, pp. 491\u2013502.","DOI":"10.1007\/3-540-46541-3_41"},{"key":"10.1016\/S0304-3975(03)00242-1_BIB5","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/0304-3975(94)90244-5","article-title":"Inversion of 2D cellular automata","volume":"134","author":"Durand","year":"1994","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"10.1016\/S0304-3975(03)00242-1_BIB6","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1016\/S0022-0000(05)80077-7","article-title":"The surjectivity problem for 2D cellular automata","volume":"49","author":"Durand","year":"1994","journal-title":"J. Comput. Systems Sci."},{"issue":"1","key":"10.1016\/S0304-3975(03)00242-1_BIB7","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0304-3975(94)00293-R","article-title":"A Random NP-complete problem for inversion of 2D cellular automata","volume":"148","author":"Durand","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(03)00242-1_BIB8","doi-asserted-by":"crossref","unstructured":"B. Durand, Tilings and quasiperiodicity, in: ICALP\u201997, Lecture Notes in Computer Science, Vol. 1256, Springer, Berlin, July 1997, pp. 65\u201375.","DOI":"10.1007\/3-540-63165-8_165"},{"issue":"1-2","key":"10.1016\/S0304-3975(03)00242-1_BIB9","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/S0304-3975(99)00027-4","article-title":"Tilings and quasiperiodicity","volume":"221","author":"Durand","year":"1999","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(03)00242-1_BIB10","series-title":"Recurrence in Ergodic Theory and Combinatorial Number Theory","author":"Furstenberg","year":"1981"},{"key":"10.1016\/S0304-3975(03)00242-1_BIB11","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1016\/0022-0000(91)90007-R","article-title":"Average case completeness","volume":"42","author":"Gurevich","year":"1991","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(03)00242-1_BIB12","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/BF00971620","article-title":"A remark on Berger's paper on the domino problem","volume":"13","author":"Gurevich","year":"1972","journal-title":"Siberian J. Math."},{"key":"10.1016\/S0304-3975(03)00242-1_BIB13","doi-asserted-by":"crossref","unstructured":"K. Ingersent, Matching Rules for Quasicrystalline Tilings, World Scientific, Singapore, 1991, pp. 185\u2013212.","DOI":"10.1142\/9789814503532_0007"},{"key":"10.1016\/S0304-3975(03)00242-1_BIB14","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0022-0000(05)80025-X","article-title":"Reversibility and surjectivity problems of cellular automata","volume":"48","author":"Kari","year":"1994","journal-title":"J. Comput. System Sci."},{"issue":"1","key":"10.1016\/S0304-3975(03)00242-1_BIB15","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1137\/0215020","article-title":"Average case complete problems","volume":"15","author":"Levin","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(03)00242-1_BIB16","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF01418780","article-title":"Undecidability and nonperiodicity for tilings of the plane","volume":"12","author":"Robinson","year":"1971","journal-title":"Invent. Math."},{"key":"10.1016\/S0304-3975(03)00242-1_BIB17","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/S0304-3975(97)00213-2","article-title":"Simulations between cellular automata on Cayley graphs","volume":"225","author":"R\u00f3ka","year":"1999","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(03)00242-1_BIB18","doi-asserted-by":"crossref","unstructured":"P. van Emde Boas, The convenience of tilings, in: Complexity, Logic and Recursion Theory, Lecture Notes in Pure and Applied Mathematics, Vol. 187, 1997, pp. 331\u2013363.","DOI":"10.1201\/9780429187490-12"},{"key":"10.1016\/S0304-3975(03)00242-1_BIB19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/j.1538-7305.1961.tb03975.x","article-title":"Proving theorems by pattern recognition II","volume":"40","author":"Wang","year":"1961","journal-title":"Bell System Tech. J."},{"key":"10.1016\/S0304-3975(03)00242-1_BIB20","unstructured":"H. Wang, Dominoes and the \u2200\u2203\u2200-case of the decision problem, in: Proc. Symp. on Mathematical Theory of Automata, Brooklyn Polytechnic Institute, New York, 1962, pp. 23\u201355."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503002421?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503002421?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T19:54:08Z","timestamp":1584647648000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397503002421"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,1]]},"references-count":20,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2004,1]]}},"alternative-id":["S0304397503002421"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(03)00242-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2004,1]]}}}