{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,4]],"date-time":"2026-01-04T15:26:43Z","timestamp":1767540403377,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031332630"},{"type":"electronic","value":"9783031332647"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-33264-7_9","type":"book-chapter","created":{"date-parts":[[2023,5,18]],"date-time":"2023-05-18T08:03:26Z","timestamp":1684397006000},"page":"100-112","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Domino Problem Is Undecidable on\u00a0Every Rhombus Subshift"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5194-929X","authenticated-orcid":false,"given":"Benjamin","family":"Hellouin de Menibus","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1261-0661","authenticated-orcid":false,"given":"Victor H.","family":"Lutfalla","sequence":"additional","affiliation":[]},{"given":"Camille","family":"No\u00fbs","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,19]]},"reference":[{"key":"9_CR1","series-title":"Trends in Mathematics","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-319-69152-7_9","volume-title":"Sequences, Groups, and Number Theory","author":"N Aubrun","year":"2018","unstructured":"Aubrun, N., Barbieri, S., Jeandel, E.: About the domino problem for subshifts on groups. In: Berth\u00e9, V., Rigo, M. (eds.) Sequences, Groups, and Number Theory. TM, pp. 331\u2013389. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-69152-7_9"},{"key":"9_CR2","doi-asserted-by":"publisher","unstructured":"Aubrun, N., Sablik, M., Esnay, J.: Domino problem under horizontal constraints. In: STACS 2020, (2020). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2020.26","DOI":"10.4230\/LIPIcs.STACS.2020.26"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Baake, M., Grimm, U.: Aperiodic Order: A Mathematical Invitation. Cambridge University Press, Cambridge (2013)","DOI":"10.1017\/CBO9781139025256"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-319-40189-8_21","volume-title":"Pursuit of the Universal","author":"S Barbieri","year":"2016","unstructured":"Barbieri, S., Sablik, M.: The domino problem for self-similar structures. In: Beckmann, A., Bienvenu, L., Jonoska, N. (eds.) CiE 2016. LNCS, vol. 9709, pp. 205\u2013214. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-40189-8_21"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Berger, R.: The Undecidability of the Domino Problem. American Mathematical Soc., Providence (1966)","DOI":"10.1090\/memo\/0066"},{"key":"9_CR6","doi-asserted-by":"publisher","unstructured":"de Bruijn, N.G.: Algebraic theory of Penrose\u2019s non-periodic tilings of the plane. I. In: Indagationes Mathematicae (Proceedings), January 1981. https:\/\/doi.org\/10.1016\/1385-7258(81)90016-0","DOI":"10.1016\/1385-7258(81)90016-0"},{"key":"9_CR7","doi-asserted-by":"publisher","unstructured":"Dworkin, S., Shieh, J.-I.: Deceptions in quasicrystal growth. Commun. Math. Phys, March 1995. https:\/\/doi.org\/10.1007\/BF02101553","DOI":"10.1007\/BF02101553"},{"key":"9_CR8","unstructured":"Gr\u00fcnbaum, B., Shephard, G.C.: Tilings and Patterns. Courier Dover Publications, New York (1987)"},{"key":"9_CR9","unstructured":"Jang, H.: Directional Expansiveness. PhD thesis, George Washington University (2021)"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Kenyon, R.: Tiling a polygon with parallelograms. Algorithmica, April 1993. DOIurlhttps:\/\/doi.org\/10.1007\/BF01228510","DOI":"10.1007\/BF01228510"},{"key":"9_CR11","doi-asserted-by":"publisher","unstructured":"Kozen, D.C.: Theory of Computation. Springer, May 2006. https:\/\/doi.org\/10.1007\/1-84628-477-5","DOI":"10.1007\/1-84628-477-5"},{"key":"9_CR12","unstructured":"Lutfalla, V.H.: Geometrical tilings : Distance, topology, compactness and completeness (2022). https:\/\/arxiv.org\/abs\/2208.14922"},{"key":"9_CR13","unstructured":"Monin, B., Patey, L.: Calculabilit\u00e9: Degr\u00e9s Turing, Th\u00e9orie Algorithmique de l\u2019al\u00e9atoire, Math\u00e9matiques \u00e0 Rebours. Hypercalculabilit\u00e9, Calvage et Mounet (2022)"},{"key":"9_CR14","unstructured":"Penrose, R.: The role of aesthetics in pure and applied mathematical research. Bulletin of the Institute of Mathematics and its Applications (1974)"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Robinson, E.A.: Symbolic dynamics and tilings of $$\\mathbb{R} ^d$$. In: Proceedings of Symposia in Applied Mathematics, vol. 60, pp. 81\u2013120 (2004)","DOI":"10.1090\/psapm\/060\/2078847"},{"key":"9_CR16","unstructured":"Senechal, M.: Quasicrystals and Geometry. Cambridge University Press, Cambridge (1996)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-33264-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,18]],"date-time":"2023-05-18T08:04:24Z","timestamp":1684397064000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33264-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031332630","9783031332647"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33264-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"19 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DLT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Developments in Language Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ume\u00e5","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dlt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dltwords2023.cs.umu.se\/dlt","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"59% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4- Invited papers and 32 submissions (31 regular ones and one invited)","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}