{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T20:26:01Z","timestamp":1772742361918,"version":"3.50.1"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030850876","type":"print"},{"value":"9783030850883","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-85088-3_1","type":"book-chapter","created":{"date-parts":[[2021,9,5]],"date-time":"2021-09-05T23:03:24Z","timestamp":1630883004000},"page":"1-19","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Synchronized Sequences"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1197-3820","authenticated-orcid":false,"given":"Jeffrey","family":"Shallit","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,6]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1051\/ita\/1989230302351","volume":"23","author":"J-P Allouche","year":"1989","unstructured":"Allouche, J.-P., B\u00e9tr\u00e9ma, J., Shallit, J.: Sur des points fixes de morphismes du mono\u00efde libre. RAIRO Inform. Th\u00e9or. App. 23, 235\u2013249 (1989)","journal-title":"RAIRO Inform. Th\u00e9or. App."},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/s00010-004-2750-x","volume":"69","author":"J-P Allouche","year":"2005","unstructured":"Allouche, J.-P., Rampersad, N., Shallit, J.: On integer sequences whose first iterates are linear. Aequationes Math. 69, 114\u2013127 (2005)","journal-title":"Aequationes Math."},{"key":"1_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546563","volume-title":"Automatic Sequences: Theory, Applications, Generalizations","author":"J-P Allouche","year":"2003","unstructured":"Allouche, J.-P., Shallit, J.: Automatic Sequences: Theory, Applications, Generalizations. Cambridge University Press, Cambridge (2003)"},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0304-3975(92)90001-V","volume":"98","author":"J-P Allouche","year":"1992","unstructured":"Allouche, J.-P., Shallit, J.O.: The ring of $$k$$-regular sequences. Theoret. Comput. Sci. 98, 163\u2013197 (1992)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(03)00090-2","volume":"307","author":"J-P Allouche","year":"2003","unstructured":"Allouche, J.-P., Shallit, J.O.: The ring of $$k$$-regular sequences. II. Theoret. Comput. Sci. 307, 3\u201329 (2003)","journal-title":"II. Theoret. Comput. Sci."},{"key":"1_CR6","unstructured":"Blondin Mass\u00e9, A., Brlek, S., Garon, A., Labb\u00e9, S.: Combinatorial properties of $$f$$-palindromes in the Thue-Morse sequence. Pure Math. Appl. 19(2\u20133), 39\u201352 (2008). http:\/\/puma.dimai.unifi.it\/19_2_3\/4.pdf"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Bruy\u00e8re, V., Hansel, G., Michaux, C., Villemaire, R.: Logic and $$p$$-recognizable sets of integers. Bull. Belgian Math. Soc. 1, 191\u2013238 (1994). corrigendum, Bull. Belgian Math. Soc. 1, 577 (1994)","DOI":"10.36045\/bbms\/1103408547"},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"3281","DOI":"10.1090\/tran\/7378","volume":"371","author":"Y Bugeaud","year":"2019","unstructured":"Bugeaud, Y., Kim, D.H.: A new complexity function, repetitions in Sturmian words, and irrationality exponents of Sturmian numbers. Trans. Amer. Math. Soc. 371, 3281\u20133308 (2019)","journal-title":"Trans. Amer. Math. Soc."},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1142\/S0218196709004968","volume":"19","author":"A Carpi","year":"2009","unstructured":"Carpi, A., D\u2019Alonzo, V.: On the repetitivity index of infinite words. Int. J. Algebra Comput. 19, 145\u2013158 (2009)","journal-title":"Int. J. Algebra Comput."},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1051\/ita:2001129","volume":"35","author":"A Carpi","year":"2001","unstructured":"Carpi, A., Maggi, C.: On synchronized sequences and their separators. RAIRO Inform. Th\u00e9or. App. 35, 513\u2013524 (2001)","journal-title":"RAIRO Inform. Th\u00e9or. App."},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.1142\/S0129054112400448","volume":"23","author":"E Charlier","year":"2012","unstructured":"Charlier, E., Rampersad, N., Shallit, J.: Enumeration and decidable properties of automatic sequences. Int. J. Found. Comp. Sci. 23, 1035\u20131066 (2012)","journal-title":"Int. J. Found. Comp. Sci."},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.tcs.2018.04.023","volume":"732","author":"FM Dekking","year":"2018","unstructured":"Dekking, F.M.: The Frobenius problem for homomorphic embeddings of languages into the integers. Theoret. Comput. Sci. 732, 73\u201379 (2018)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-642-38771-5_23","volume-title":"Developments in Language Theory","author":"D Go\u010d","year":"2013","unstructured":"Go\u010d, D., Schaeffer, L., Shallit, J.: Subword complexity and k-synchronization. In: B\u00e9al, M.-P., Carton, O. (eds.) DLT 2013. LNCS, vol. 7907, pp. 252\u2013263. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38771-5_23"},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/BF01199431","volume":"38","author":"D Hilbert","year":"1891","unstructured":"Hilbert, D.: \u00dcber die stetige Abbildung einer Linie auf ein Fl\u00e4chenst\u00fcck. Math. Annalen 38, 459\u2013460 (1891)","journal-title":"Math. Annalen"},{"key":"1_CR15","first-page":"190","volume":"29","author":"CG Lekkerkerker","year":"1952","unstructured":"Lekkerkerker, C.G.: Voorstelling van natuurlijke getallen door een som van getallen van Fibonacci. Simon Stevin 29, 190\u2013195 (1952)","journal-title":"Simon Stevin"},{"key":"1_CR16","unstructured":"Mousavi, H.: Automatic theorem proving in Walnut (2016). Preprint available at http:\/\/arxiv.org\/abs\/1603.06017"},{"key":"1_CR17","unstructured":"Propp, J.: Problem proposal 474. Crux Math. 5, 229 (1979). Solution by G. Patruno, Crux Math. 6, 198 (1980)"},{"key":"1_CR18","unstructured":"Reble, D.: Zeckendorf vs. Wythoff representations: comments on A007895 (2008). Manuscript available at https:\/\/oeis.org\/A007895\/a007895.pdf"},{"key":"1_CR19","unstructured":"Shallit, J.: Hilbert\u2019s spacefilling curve described by automatic, regular, and synchronized sequences (2021). Preprint, https:\/\/arxiv.org\/abs\/2106.01062"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Shallit, J.: The Logical Approach to Automatic Sequences: Exploring Combinatorics on Words with Walnut. Cambridge University Press (2022, to appear)","DOI":"10.1017\/9781108775267"},{"key":"1_CR21","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1006\/inco.1994.1076","volume":"113","author":"JO Shallit","year":"1994","unstructured":"Shallit, J.O.: Numeration systems, linear recurrences, and regular sets. Inform. Comput. 113, 331\u2013347 (1994)","journal-title":"Inform. Comput."},{"key":"1_CR22","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0097-8493(89)90060-5","volume":"13","author":"JO Shallit","year":"1989","unstructured":"Shallit, J.O., Stolfi, J.: Two methods for generating fractals. Comput. Graph. 13, 185\u2013191 (1989)","journal-title":"Comput. Graph."},{"key":"1_CR23","unstructured":"Sloane, N.J.A., et al.: The on-line encyclopedia of integer sequences (2021). https:\/\/oeis.org"},{"key":"1_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1007\/3-540-55808-X_48","volume-title":"Mathematical Foundations of Computer Science 1992","author":"A Szilard","year":"1992","unstructured":"Szilard, A., Yu, S., Zhang, K., Shallit, J.: Characterizing regular languages with polynomial densities. In: Havel, I.M., Koubek, V. (eds.) MFCS 1992. LNCS, vol. 629, pp. 494\u2013503. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-55808-X_48"},{"key":"1_CR25","first-page":"199","volume":"7","author":"WA Wythoff","year":"1907","unstructured":"Wythoff, W.A.: A modification of the game of Nim. Nieuw Archief voor Wiskunde 7, 199\u2013202 (1907)","journal-title":"Nieuw Archief voor Wiskunde"},{"key":"1_CR26","first-page":"179","volume":"41","author":"E Zeckendorf","year":"1972","unstructured":"Zeckendorf, E.: Repr\u00e9sentation des nombres naturels par une somme de nombres de Fibonacci ou de nombres de Lucas. Bull. Soc. Roy. Li\u00e8ge 41, 179\u2013182 (1972)","journal-title":"Bull. Soc. Roy. Li\u00e8ge"}],"container-title":["Lecture Notes in Computer Science","Combinatorics on Words"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-85088-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T16:50:24Z","timestamp":1673196624000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-85088-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030850876","9783030850883"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-85088-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"6 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WORDS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorics on Words","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cwords2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/words2021.sciencesconf.org\/","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":"18","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":"11","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":"3","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":"61% - 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":"3","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":"2 invited papers are also included","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)"}}]}}