{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:27:33Z","timestamp":1743067653634,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030232467"},{"type":"electronic","value":"9783030232474"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-23247-4_2","type":"book-chapter","created":{"date-parts":[[2019,7,7]],"date-time":"2019-07-07T23:02:38Z","timestamp":1562540558000},"page":"35-45","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Low-Complexity Tilings of the Plane"],"prefix":"10.1007","author":[{"given":"Jarkko","family":"Kari","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,25]]},"reference":[{"issue":"1","key":"2_CR1","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S0012-365X(02)00744-6","volume":"268","author":"MA Axenovich","year":"2003","unstructured":"Axenovich, M.A.: On multiple coverings of the infinite rectangular grid with balls of constant radius. Discrete Math. 268(1), 31\u201348 (2003). https:\/\/doi.org\/10.1016\/S0012-365X(02)00744-6","journal-title":"Discrete Math."},{"key":"2_CR2","unstructured":"Bhattacharya, S.: Periodicity and decidability of tilings of $$\\mathbb{Z}^{2}$$. CoRR abs\/1602. 05738 (2016). https:\/\/arxiv.org\/abs\/1602.05738"},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"305","DOI":"10.24033\/bsmf.909","volume":"40","author":"GD Birkhoff","year":"1912","unstructured":"Birkhoff, G.D.: Quelques th\u00e9or\u00e8mes sur le mouvement des syst\u00e8mes dynamiques. Bull. Soc. Math. France 40, 305\u2013323 (1912). https:\/\/doi.org\/10.24033\/bsmf.909","journal-title":"Bull. Soc. Math. France"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Cassaigne, J.: Subword complexity and periodicity in two or more dimensions. In: Rozenberg, G., Thomas, W. (eds.) Developments in Language Theory. Foundations, Applications, and Perspectives, pp. 14\u201321. World Scientific (1999)","DOI":"10.1142\/9789812792464_0002"},{"issue":"9","key":"2_CR5","doi-asserted-by":"publisher","first-page":"6487","DOI":"10.1090\/S0002-9947-2015-06391-0","volume":"367","author":"V Cyr","year":"2015","unstructured":"Cyr, V., Kra, B.: Nonexpansive $${\\mathbb{Z}}^2$$-subdynamics and Nivat\u2019s Conjecture. Trans. Amer. Math. Soc. 367(9), 6487\u20136537 (2015). https:\/\/doi.org\/10.1090\/S0002-9947-2015-06391-0","journal-title":"Trans. Amer. Math. Soc."},{"key":"2_CR6","unstructured":"Kari, J., Moutot, E.: Decidability and periodicity of low complexity tilings. CoRR abs\/1904.01267 (2019). http:\/\/arxiv.org\/abs\/1904.01267"},{"key":"2_CR7","doi-asserted-by":"publisher","unstructured":"Kari, J., Moutot, E.: Nivat\u2019s conjecture and pattern complexity in algebraic subshifts. Theoret. Comput. Sci. (2019, to appear). https:\/\/doi.org\/10.1016\/j.tcs.2018.12.029","DOI":"10.1016\/j.tcs.2018.12.029"},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-319-23021-4_3","volume-title":"Algebraic Informatics","author":"J Kari","year":"2015","unstructured":"Kari, J., Szabados, M.: An algebraic geometric approach to multidimensional words. In: Maletti, A. (ed.) CAI 2015. LNCS, vol. 9270, pp. 29\u201342. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23021-4_3"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-662-47666-6_22","volume-title":"Automata, Languages, and Programming","author":"J Kari","year":"2015","unstructured":"Kari, J., Szabados, M.: An algebraic geometric approach to Nivat\u2019s conjecture. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9135, pp. 273\u2013285. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47666-6_22"},{"key":"2_CR10","unstructured":"Kari, J., Szabados, M.: An algebraic geometric approach to Nivat\u2019s conjecture. CoRR abs\/1605.05929 (2016). http:\/\/arxiv.org\/abs\/1605.05929"},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s002220050056","volume":"124","author":"JC Lagarias","year":"1996","unstructured":"Lagarias, J.C., Wang, Y.: Tiling the line with translates of one tile. Invent. Math. 124, 341\u2013365 (1996). https:\/\/doi.org\/10.1007\/s002220050056","journal-title":"Invent. Math."},{"key":"2_CR12","unstructured":"Nivat, M.: Keynote address at the 25th anniversary of EATCS, during ICALP (1997)"},{"key":"2_CR13","doi-asserted-by":"publisher","unstructured":"Schmidt, K.: Dynamical systems of algebraic origin. Progress in mathematics. Birkh\u00e4user, Basel (1995). https:\/\/doi.org\/10.1007\/978-3-0348-0277-2","DOI":"10.1007\/978-3-0348-0277-2"},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/978-3-319-73117-9_38","volume-title":"SOFSEM 2018: Theory and Practice of Computer Science","author":"M Szabados","year":"2018","unstructured":"Szabados, M.: Nivat\u2019s conjecture holds for sums of two periodic configurations. In: Tjoa, A.M., Bellatreche, L., Biffl, S., van Leeuwen, J., Wiedermann, J. (eds.) SOFSEM 2018. LNCS, vol. 10706, pp. 539\u2013551. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-73117-9_38"},{"key":"2_CR15","doi-asserted-by":"publisher","unstructured":"Szegedy, M.: Algorithms to tile the infinite grid with finite clusters. In: Proceedings 39th Annual Symposium on Foundations of Computer Science, FOCS 1998, pp. 137\u2013147. IEEE Computer Society (1998). https:\/\/doi.org\/10.1109\/SFCS.1998.743437","DOI":"10.1109\/SFCS.1998.743437"},{"issue":"1","key":"2_CR16","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. Tech. J. 40(1), 1\u201341 (1961). https:\/\/doi.org\/10.1002\/j.1538-7305.1961.tb03975.x","journal-title":"Bell Syst. Tech. J."}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-23247-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T06:50:57Z","timestamp":1739343057000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-23247-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030232467","9783030232474"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-23247-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"25 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DCFS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Descriptional Complexity of Formal Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ko\u0161ice","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovakia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 July 2019","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":"dcfs2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/im.saske.sk\/dcfs2019\/","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":"25","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":"18","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":"72% - 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,1","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":"2,9","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":"there are also 4 invited talks","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)"}}]}}