{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:17:38Z","timestamp":1740097058720,"version":"3.37.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319096971"},{"type":"electronic","value":"9783319096988"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09698-8_20","type":"book-chapter","created":{"date-parts":[[2014,8,17]],"date-time":"2014-08-17T20:52:51Z","timestamp":1408308771000},"page":"227-238","source":"Crossref","is-referenced-by-count":0,"title":["Knight Tiles: Particles and Collisions in the Realm of 4-Way Deterministic Tilings"],"prefix":"10.1007","author":[{"given":"Bastien","family":"Le Gloannec","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Ollinger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"20_CR1","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1147\/rd.176.0525","volume":"17","author":"C.H. Bennett","year":"1973","unstructured":"Bennett, C.H.: Logical reversibility of computation. IBM J. Res. Dev.\u00a017(6), 525\u2013532 (1973), \n                    \n                      http:\/\/dx.doi.org\/10.1147\/rd.176.0525","journal-title":"IBM J. Res. Dev."},{"key":"20_CR2","unstructured":"Berger, R.: The Undecidability of the Domino Problem. Ph.D. thesis. Harvard University (1964)"},{"issue":"1","key":"20_CR3","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1090\/S0002-9947-97-01634-6","volume":"349","author":"M. Boyle","year":"1997","unstructured":"Boyle, M., Lind, D.: Expansive subdynamics. Transactions of the American Mathematical Society\u00a0349(1), 55\u2013102 (1997)","journal-title":"Transactions of the American Mathematical Society"},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s000390050090","volume":"9","author":"J. Kari","year":"1999","unstructured":"Kari, J., Papasoglu, P.: Deterministic aperiodic tile sets. Geometric and Functional Analysis\u00a09, 353\u2013369 (1999), \n                    \n                      http:\/\/dx.doi.org\/10.1007\/s000390050090","journal-title":"Geometric and Functional Analysis"},{"issue":"2","key":"20_CR5","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0304-3975(94)90041-8","volume":"127","author":"J. Kari","year":"1994","unstructured":"Kari, J.: Rice\u2019s theorem for the limit sets of cellular automata. Theor. Comput. Sci.\u00a0127(2), 229\u2013254 (1994)","journal-title":"Theor. Comput. Sci."},{"key":"20_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/978-3-642-30870-3_47","volume-title":"How the World Computes","author":"B. Gloannec Le","year":"2012","unstructured":"Le Gloannec, B., Ollinger, N.: Substitutions and strongly deterministic tilesets. In: Cooper, S.B., Dawar, A., L\u00f6we, B. (eds.) CiE 2012. LNCS, vol.\u00a07318, pp. 462\u2013471. Springer, Heidelberg (2012)"},{"key":"20_CR7","first-page":"2597","volume":"257","author":"Y. Lecerf","year":"1963","unstructured":"Lecerf, Y.: Machines de Turing r\u00e9versibles. Comptes rendus de l\u2019Acad\u00e9mie fran\u00e7aise des Sciences\u00a0257, 2597\u20132600 (1963)","journal-title":"Comptes rendus de l\u2019Acad\u00e9mie fran\u00e7aise des Sciences"},{"issue":"16","key":"20_CR8","doi-asserted-by":"publisher","first-page":"1516","DOI":"10.1016\/j.tcs.2008.12.006","volume":"410","author":"V. Lukkarila","year":"2009","unstructured":"Lukkarila, V.: The 4-way deterministic tiling problem is undecidable. Theor. Comput. Sci.\u00a0410(16), 1516\u20131533 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"20_CR9","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0304-3975(95)00038-X","volume":"148","author":"K. Morita","year":"1995","unstructured":"Morita, K.: Reversible simulation of one-dimensional irreversible cellular automata. Theoretical Computer Science\u00a0148(1), 157\u2013163 (1995)","journal-title":"Theoretical Computer Science"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Pytheas Fogg, N.: Substitutions in Dynamics, Arithmetics and Combinatorics. Lecture Notes in Mathematics. Springer (2002), \n                    \n                      http:\/\/books.google.fr\/books?id=Cmogpq-lSnoC","DOI":"10.1007\/b13861"},{"issue":"3","key":"20_CR11","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(3), 177\u2013209 (1971)","journal-title":"Inventiones Mathematicae"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09698-8_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T12:27:10Z","timestamp":1558960030000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-09698-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319096971","9783319096988"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09698-8_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}