{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:31:21Z","timestamp":1742952681469,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642207112"},{"type":"electronic","value":"9783642207129"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20712-9_17","type":"book-chapter","created":{"date-parts":[[2011,6,11]],"date-time":"2011-06-11T04:05:22Z","timestamp":1307765122000},"page":"223-232","source":"Crossref","is-referenced-by-count":2,"title":["Snakes and Cellular Automata: Reductions and Inseparability Results"],"prefix":"10.1007","author":[{"given":"Jarkko","family":"Kari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Adleman, L.: Towards a mathematical theory of self-assembly. Technical Report 00-722, Department of Computer Science, University of Southern California (2000)","key":"17_CR1"},{"doi-asserted-by":"crossref","unstructured":"Adleman, L., Kari, J., Kari, L., Reishus, D.: On the decidability of self-asssembly of infinite ribbons. In: Proceedings of FOCS 2002, 43rd Annual Symposium on Foundations of Computer Science, pp. 530\u2013537 (2002)","key":"17_CR2","DOI":"10.1109\/SFCS.2002.1181977"},{"issue":"6","key":"17_CR3","doi-asserted-by":"publisher","first-page":"2356","DOI":"10.1137\/080723971","volume":"38","author":"L. Adleman","year":"2009","unstructured":"Adleman, L., Kari, J., Kari, L., Reishus, D., Sos\u00edk, P.: The Undecidability of the Infinite Ribbon Problem: Implications for Computing by Self-Assembly. SIAM Journal on Computing\u00a038(6), 2356\u20132381 (2009)","journal-title":"SIAM Journal on Computing"},{"doi-asserted-by":"crossref","unstructured":"Berger, R.: The undecidability of the domino problem. Mem. Amer. Math. Soc.\u00a066 (1966)","key":"17_CR4","DOI":"10.1090\/memo\/0066"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0022-0000(05)80077-7","volume":"49","author":"B. Durand","year":"1994","unstructured":"Durand, B.: The surjectivity problem for 2D Cellular Automata. Journal of Computer and System Sciences\u00a049, 149\u2013182 (1994)","journal-title":"Journal of Computer and System Sciences"},{"key":"17_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":"Etzion-Petruschka, Y., Harel, D., Myers, D.: On the solvability of domino snake problems. Theoretical Computer Science\u00a0131, 243\u2013269 (1994)","journal-title":"Theoretical Computer Science"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/BF01691062","volume":"3","author":"G. Hedlund","year":"1969","unstructured":"Hedlund, G.: Endomorphisms and automorphisms of shift dynamical systems. Mathematical Systems Theory\u00a03, 320\u2013375 (1969)","journal-title":"Mathematical Systems Theory"},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/0167-2789(90)90195-U","volume":"45","author":"J. Kari","year":"1990","unstructured":"Kari, J.: Reversibility of 2D cellular automata is undecidable. Physica D\u00a045, 379\u2013385 (1990)","journal-title":"Physica D"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0022-0000(05)80025-X","volume":"48","author":"J. Kari","year":"1994","unstructured":"Kari, J.: Reversibility and surjectivity problems of cellular automata. Journal of Computer and System Sciences\u00a048, 149\u2013182 (1994)","journal-title":"Journal of Computer and System Sciences"},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/3-540-45005-X_6","volume-title":"Developments in Language Theory","author":"J. Kari","year":"2003","unstructured":"Kari, J.: Infinite Snake Tiling Problems. In: Ito, M., Toyama, M. (eds.) DLT 2002. LNCS, vol.\u00a02450, pp. 67\u201377. Springer, Heidelberg (2003)"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2004.11.021","volume":"334","author":"J. Kari","year":"2005","unstructured":"Kari, J.: Theory of Cellular Automata: a survey. Theoretical Computer Science\u00a0334, 3\u201333 (2005)","journal-title":"Theoretical Computer Science"},{"key":"17_CR12","first-page":"800","volume":"53","author":"S. Kleene","year":"1950","unstructured":"Kleene, S.: A symmetric form of G\u00f6del\u2019s theorem. Proceedings of the Koninklijke Nederlandse Akademie van Wetenschappen, Series A\u00a053, 800\u2013802 (1950); Also inIndagationes Mathematicae\u00a012, 244\u2013246 (1950)","journal-title":"Proceedings of the Koninklijke Nederlandse Akademie van Wetenschappen, Series A"},{"doi-asserted-by":"crossref","unstructured":"Moore, E.F.: Machine Models of Self-reproduction. In: Proceedings of the Symposium in Applied Mathematics, vol.\u00a014, pp. 17\u201333 (1962)","key":"17_CR13","DOI":"10.1090\/psapm\/014\/9961"},{"key":"17_CR14","first-page":"685","volume":"14","author":"J. Myhill","year":"1963","unstructured":"Myhill, J.: The Converse to Moore\u2019s Garden-of-Eden Theorem. Proceedings of the American Mathematical Society\u00a014, 685\u2013686 (1963)","journal-title":"Proceedings of the American Mathematical Society"},{"key":"17_CR15","doi-asserted-by":"publisher","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 Systems Technical Journal\u00a040, 1\u201342 (1961)","journal-title":"Bell Systems Technical Journal"},{"unstructured":"Winfree, E.: Algorithmic Self-Assembly of DNA. Ph.D. thesis, California Institute of Technology, Pasadena, CA (1998)","key":"17_CR16"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20712-9_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,6]],"date-time":"2025-03-06T03:23:47Z","timestamp":1741231427000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20712-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642207112","9783642207129"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20712-9_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}