{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T15:08:09Z","timestamp":1791299289406,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540404316","type":"print"},{"value":"9783540450054","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45005-x_6","type":"book-chapter","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T08:27:47Z","timestamp":1192782467000},"page":"67-77","source":"Crossref","is-referenced-by-count":12,"title":["Infinite Snake Tiling Problems"],"prefix":"10.1007","author":[{"given":"Jarkko","family":"Kari","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"6_CR1","unstructured":"L. Adleman. Towards a mathematical theory of self-assembly. Technical Report 00-722 (2000), Department of Computer Science, University of Southern California."},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"L. Adleman, J. Kari, L. Kari, D. Reishus. On the decidability of self-asssembly of infinite ribbons. Proceedings of FOCS\u20192002, 43rd Annual Symposium on Foundations of Computer Science (2002), 530\u2013537.","DOI":"10.1109\/SFCS.2002.1181977"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"R. Berger. The undecidability of the domino problem. Mem.Amer.Math.Soc. 66 (1966).","DOI":"10.1090\/memo\/0066"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0022-0000(05)80077-7","volume":"49","author":"B. Durand","year":"1994","unstructured":"B. Durand. The surjectivity problem for 2D Cellular Automata. Journal of Computer and System Sciences 49 (1994), 149\u2013182.","journal-title":"Journal of Computer and System Sciences"},{"key":"6_CR5","unstructured":"Y. Etzion. On the solvability of domino snake problems. MSc. Thesis. Dept. of Applied Math. and Computer Science, The Weizmann Institute of Science, Rehovot, Israel, 1991."},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0304-3975(94)90174-0","volume":"131","author":"Y. Etzion-Petruschka","year":"1994","unstructured":"Y. Etzion-Petruschka, D. Harel, D. Myers. On the solvability of domino snake problems. Theoretical Computer Science 131 (1994), 243\u2013269.","journal-title":"Theoretical Computer Science"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/0167-2789(90)90195-U","volume":"54","author":"J. Kari","year":"1990","unstructured":"J. Kari. Reversibility of 2D cellular automata is undecidable. Physica D 54 (1990), 379\u2013385.","journal-title":"Physica D"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0022-0000(05)80025-X","volume":"48","author":"J. Kari","year":"1994","unstructured":"J. Kari. Reversibility and surjectivity problems of cellular automata. Journal of Computer and System Sciences 48 (1994), 149\u2013182.","journal-title":"Journal of Computer and System Sciences"},{"issue":"26","key":"6_CR9","first-page":"A","volume":"195","author":"D. Myers","year":"1979","unstructured":"D. Myers. Decidability of the tiling connectivity problem. Abstract 79T-E42, Notices Amer. Math. Soc. 195(26) (1979), A\u2013441.","journal-title":"Notices Amer. Math. Soc."},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/BF01418780","volume":"12","author":"R. M. Robinson","year":"(1971","unstructured":"R. M. Robinson. Undecidability and nonperiodicity for tilings of the plane. Inven. Math. 12 (1971), 177\u2013209.","journal-title":"Inven. Math."},{"key":"6_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/j.1538-7305.1961.tb03975.x","volume":"40","author":"H. Wang","year":"1961","unstructured":"H. Wang. Proving theorems by pattern recognition. II. Bell Systems Technical Journal 40 (1961), 1\u201342.","journal-title":"Bell Systems Technical Journal"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45005-X_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T19:10:32Z","timestamp":1737486632000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45005-X_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540404316","9783540450054"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-45005-x_6","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2003]]}}}