{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T04:07:18Z","timestamp":1750392438764,"version":"3.41.0"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031959073","type":"print"},{"value":"9783031959080","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-95908-0_26","type":"book-chapter","created":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T08:54:07Z","timestamp":1750323247000},"page":"365-379","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Multidimensional Tilings and\u00a0MSO Logic"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-6708-6904","authenticated-orcid":false,"given":"R\u00e9mi","family":"Pallen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5541-8517","authenticated-orcid":false,"given":"Ilkka","family":"T\u00f6rm\u00e4","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,20]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Berger, R.: The Undecidability of the Domino Problem. Memoirs of the American Mathematical Society. American Mathematical Society (1966). https:\/\/books.google.fi\/books?id=mLfTCQAAQBAJ","DOI":"10.1090\/memo\/0066"},{"issue":"1","key":"26_CR2","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1006\/inco.1996.0018","volume":"125","author":"D Giammarresi","year":"1996","unstructured":"Giammarresi, D., Restivo, A., Seibert, S., Thomas, W.: Monadic second-order logic over rectangular pictures and recognizability by tiling systems. Inf. Comput. 125(1), 32\u201345 (1996). https:\/\/doi.org\/10.1006\/inco.1996.0018","journal-title":"Inf. Comput."},{"key":"26_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2013.01.003","volume":"225","author":"E Jeandel","year":"2013","unstructured":"Jeandel, E., Theyssier, G.: Subshifts as models for MSO logic. Inf. Comput. 225, 1\u201315 (2013)","journal-title":"Inf. Comput."},{"issue":"11","key":"26_CR4","doi-asserted-by":"publisher","first-page":"3803","DOI":"10.1090\/S0002-9939-2013-11646-1","volume":"141","author":"S Kass","year":"2013","unstructured":"Kass, S., Madden, K.: A sufficient condition for non-soficness of higher-dimensional subshifts. Proc. Am. Math. Soc. 141(11), 3803\u20133816 (2013). https:\/\/doi.org\/10.1090\/S0002-9939-2013-11646-1","journal-title":"Proc. Am. Math. Soc."},{"key":"26_CR5","doi-asserted-by":"publisher","unstructured":"Lind, D., Marcus, B.: An Introduction to Symbolic Dynamics and Coding, 2 edn. Cambridge Mathematical Library. Cambridge University Press, Cambridge (2021). https:\/\/doi.org\/10.1017\/9781108899727","DOI":"10.1017\/9781108899727"},{"key":"26_CR6","doi-asserted-by":"publisher","unstructured":"Salo, V., T\u00f6rm\u00e4, I.: Diddy: a python toolbox for infinite discrete dynamical systems. In: Cellular Automata and Discrete Complex Systems, vol. 14152 of LNCS, pp. 33\u201347. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-42250-8_3","DOI":"10.1007\/978-3-031-42250-8_3"},{"key":"26_CR7","unstructured":"Salo, V., T\u00f6rm\u00e4, I.: Griddy (2023). GitHub repository. https:\/\/github.com\/ilkka-torma\/griddy"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Thomas, W.: Languages, automata, and logic. In: Handbook of Formal Languages, vol. 3, pp. 389\u2013455. Springer, Berlin (1997)","DOI":"10.1007\/978-3-642-59126-6_7"},{"key":"26_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-662-44602-7_10","volume-title":"Theoretical Computer Science","author":"I T\u00f6rm\u00e4","year":"2014","unstructured":"T\u00f6rm\u00e4, I.: Subshifts, MSO logic, and collapsing hierarchies. In: Diaz, J., Lanese, I., Sangiorgi, D. (eds.) TCS 2014. LNCS, vol. 8705, pp. 111\u2013122. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44602-7_10"},{"issue":"1","key":"26_CR10","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 Syst. Techn. J. 40(1), 1\u201341 (1961). https:\/\/doi.org\/10.1002\/j.1538-7305.1961.tb03975.x","journal-title":"Bell Syst. Techn. J."}],"container-title":["Lecture Notes in Computer Science","Crossroads of Computability and Logic: Insights, Inspirations, and Innovations"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-95908-0_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T08:54:09Z","timestamp":1750323249000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-95908-0_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031959073","9783031959080"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-95908-0_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"20 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"CiE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Computability in Europe","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 July 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cie2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/cie2025-computabilityineurope\/home","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}