{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T20:46:04Z","timestamp":1773261964978,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642150241","type":"print"},{"value":"9783642150258","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-15025-8_12","type":"book-chapter","created":{"date-parts":[[2010,8,16]],"date-time":"2010-08-16T02:52:44Z","timestamp":1281927164000},"page":"208-226","source":"Crossref","is-referenced-by-count":18,"title":["Effective Closed Subshifts in 1D Can Be Implemented in 2D"],"prefix":"10.1007","author":[{"given":"Bruno","family":"Durand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrei","family":"Romashchenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","unstructured":"Aubrun, N., Sablik, M.: personal communication (February 2010) (submitted for publication)"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Berger, R.: The Undecidability of the Domino Problem. Mem. Amer. Math. Soc.\u00a066 (1966)","DOI":"10.1090\/memo\/0066"},{"key":"12_CR3","volume-title":"The Classical Decision Problem","author":"E. B\u00f6rger","year":"1987","unstructured":"B\u00f6rger, E., Gr\u00e4del, E., Gurevich, Y.: The Classical Decision Problem. Springer, Heidelberg (1987)"},{"issue":"2","key":"12_CR4","doi-asserted-by":"publisher","first-page":"593","DOI":"10.2178\/jsl\/1208359062","volume":"73","author":"B. Durand","year":"2008","unstructured":"Durand, B., Levin, L., Shen, A.: Complex Tilings. J. Symbolic Logic\u00a073(2), 593\u2013613 (2008)","journal-title":"J. Symbolic Logic"},{"issue":"1","key":"12_CR5","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/BF02984815","volume":"27","author":"B. Durand","year":"2005","unstructured":"Durand, B., Levin, L., Shen, A.: Local Rules and Global Order, or Aperiodic Tilings. Mathematical Intelligencer\u00a027(1), 64\u201368 (2005)","journal-title":"Mathematical Intelligencer"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-540-85780-8_22","volume-title":"Developments in Language Theory","author":"B. Durand","year":"2008","unstructured":"Durand, B., Romashchenko, A., Shen, A.: Fixed Point and Aperiodic Tilings. In: Ito, M., Toyama, M. (eds.) DLT 2008. LNCS, vol.\u00a05257, pp. 276\u2013288. Springer, Heidelberg (2008)"},{"key":"12_CR7","first-page":"126","volume":"97","author":"B. Durand","year":"2009","unstructured":"Durand, B., Romashchenko, A., Shen, A.: Fixed point theorem and aperiodic tilings (The Logic in Computer Science Column by Yuri Gurevich). Bulletin of the EATCS\u00a097, 126\u2013136 (2009)","journal-title":"Bulletin of the EATCS"},{"key":"12_CR8","unstructured":"Durand, B., Romashchenko, A., Shen, A.: Fixed-point tile sets and their applications. CoRR abs\/0910.2415 (2009), \n                    \n                      http:\/\/arxiv.org\/abs\/0910.2415"},{"issue":"1","key":"12_CR9","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0022-0000(86)90002-4","volume":"32","author":"P. G\u00e1cs","year":"1986","unstructured":"G\u00e1cs, P.: Reliable Computation with Cellular Automata. J. Comput. Syst. Sci.\u00a032(1), 15\u201378 (1986)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1\/2","key":"12_CR10","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1023\/A:1004823720305","volume":"103","author":"P. G\u00e1cs","year":"2001","unstructured":"G\u00e1cs, P.: Reliable Cellular Automata with Self-Organization. J. Stat. Phys.\u00a0103(1\/2), 45\u2013267 (2001)","journal-title":"J. Stat. Phys."},{"key":"12_CR11","volume-title":"Tilings and Patterns","author":"B. Grunbaum","year":"1986","unstructured":"Grunbaum, B., Shephard, G.C.: Tilings and Patterns. W.H.\u00a0Freeman & Co., New York (1986)"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/BF00971620","volume":"13","author":"Y. Gurevich","year":"1972","unstructured":"Gurevich, Y., Koryakov, I.: A remark on Berger\u2019s paper on the domino problem. Siberian Mathematical Journal\u00a013, 319\u2013321 (1972)","journal-title":"Siberian Mathematical Journal"},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/s00222-008-0161-7","volume":"176","author":"M. Hochman","year":"2009","unstructured":"Hochman, M.: On the dynamic and recursive properties of multidimensional symbolic systems. Inventiones mathematicae\u00a0176, 131\u2013167 (2009)","journal-title":"Inventiones mathematicae"},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF02793412","volume":"53","author":"S. Mozes","year":"1989","unstructured":"Mozes, S.: Tilings, Substitution Systems and Dynamical Systems Generated by Them. J. Analyse Math.\u00a053, 139\u2013186 (1989)","journal-title":"J. Analyse Math."},{"key":"12_CR15","unstructured":"von Neumann, J.: Theory of Self-reproducing Automata. In: Burks, A. (ed.). University of Illinois Press, Urbana (1966)"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/11672142_32","volume-title":"STACS 2006","author":"A. Rumyantsev","year":"2006","unstructured":"Rumyantsev, A., Ushakov, M.: Forbidden Substrings, Kolmogorov Complexity and Almost Periodic Sequences. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 396\u2013407. Springer, Heidelberg (2006)"},{"key":"12_CR17","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 System Technical Journal\u00a040, 1\u201342 (1961)","journal-title":"Bell System Technical Journal"}],"container-title":["Lecture Notes in Computer Science","Fields of Logic and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15025-8_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T17:16:42Z","timestamp":1558286202000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15025-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642150241","9783642150258"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15025-8_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}