{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:16:19Z","timestamp":1759637779788,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031331794"},{"type":"electronic","value":"9783031331800"}],"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-33180-0_15","type":"book-chapter","created":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T23:03:27Z","timestamp":1685487807000},"page":"192-205","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["String Attractors of\u00a0Fixed Points of\u00a0k-Bonacci-Like Morphisms"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8970-173X","authenticated-orcid":false,"given":"France","family":"Gheeraert","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3489-0684","authenticated-orcid":false,"given":"Giuseppe","family":"Romana","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2805-2465","authenticated-orcid":false,"given":"Manon","family":"Stipulanti","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,31]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","unstructured":"Allouche, J.P., Shallit, J.: Automatic sequences, theory, applications, generalizations Cambridge University Press, Cambridge (2003). https:\/\/doi.org\/10.1017\/CBO9780511546563","DOI":"10.1017\/CBO9780511546563"},{"key":"15_CR2","doi-asserted-by":"publisher","unstructured":"Berth\u00e9, V., Rigo, M. (eds.): Combinatorics, automata and number theory, Encyclopedia of Mathematics and its Applications, vol. 135. Cambridge University Press, Cambridge (2010). https:\/\/doi.org\/10.1017\/CBO9780511777653","DOI":"10.1017\/CBO9780511777653"},{"issue":"3\u20134","key":"15_CR3","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/BF01952053","volume":"54","author":"A Bertrand-Mathis","year":"1989","unstructured":"Bertrand-Mathis, A.: Comment \u00e9crire les nombres entiers dans une base qui n\u2019est pas enti\u00e8re. Acta Math. Hungar. 54(3\u20134), 237\u2013241 (1989). https:\/\/doi.org\/10.1007\/BF01952053","journal-title":"Acta Math. Hungar."},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/j.aam.2018.08.005","volume":"101","author":"P Bonizzoni","year":"2018","unstructured":"Bonizzoni, P., De Felice, C., Zaccagnino, R., Zizza, R.: Inverse Lyndon words and inverse Lyndon factorizations of words. Adv. in Appl. Math. 101, 281\u2013319 (2018). https:\/\/doi.org\/10.1016\/j.aam.2018.08.005","journal-title":"Adv. in Appl. Math."},{"key":"15_CR5","doi-asserted-by":"publisher","unstructured":"Charlier, E., Cisternino, C., Stipulanti, M.: A full characterization of Bertrand numeration systems. In: Developments in Language Theory, vol. 13257. LNCS, pp. 102\u2013114. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-05578-2_8","DOI":"10.1007\/978-3-031-05578-2_8"},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.jcta.2019.04.002","volume":"167","author":"E Charlier","year":"2019","unstructured":"Charlier, E., Philibert, M., Stipulanti, M.: Nyldon words. J. Combin. Theory Ser. A 167, 60\u201390 (2019). https:\/\/doi.org\/10.1016\/j.jcta.2019.04.002","journal-title":"J. Combin. Theory Ser. A"},{"key":"15_CR7","doi-asserted-by":"publisher","unstructured":"Chen, K.T., Fox, R.H., Lyndon, R.C.: Free differential calculus. IV. The quotient groups of the lower central series. Ann. of Math. 2(68), 81\u201395 (1958). https:\/\/doi.org\/10.2307\/1970044","DOI":"10.2307\/1970044"},{"key":"15_CR8","doi-asserted-by":"publisher","unstructured":"Christiansen, A.R., Ettienne, M.B., Kociumaka, T., Navarro, G., Prezza, N.: Optimal-time dictionary-compressed indexes. ACM Trans. Algorithms 17(1), 8:1\u20138:39 (2021). https:\/\/doi.org\/10.1145\/3426473","DOI":"10.1145\/3426473"},{"issue":"2","key":"15_CR9","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0304-3975(89)90041-8","volume":"65","author":"JM Dumont","year":"1989","unstructured":"Dumont, J.M., Thomas, A.: Syst\u00e8mes de num\u00e9ration et fonctions fractales relatifs aux substitutions. Theoret. Comput. Sci. 65(2), 153\u2013169 (1989). https:\/\/doi.org\/10.1016\/0304-3975(89)90041-8","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"15_CR10","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1051\/ita\/1980140201811","volume":"14","author":"JP Duval","year":"1980","unstructured":"Duval, J.P.: Mots de Lyndon et p\u00e9riodicit\u00e9. RAIRO Inform. Th\u00e9or. 14(2), 181\u2013191 (1980). https:\/\/doi.org\/10.1051\/ita\/1980140201811","journal-title":"RAIRO Inform. Th\u00e9or."},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Dvo\u0159\u00e1kov\u00e1, L.: String attractors of episturmian sequence, preprint available at arXiv:2211.01660 (2022)","DOI":"10.2139\/ssrn.4564690"},{"issue":"2","key":"15_CR12","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0304-3975(95)91132-A","volume":"137","author":"S Fabre","year":"1995","unstructured":"Fabre, S.: Substitutions et $$\\beta $$-syst\u00e8mes de num\u00e9ration. Theoret. Comput. Sci. 137(2), 219\u2013236 (1995). https:\/\/doi.org\/10.1016\/0304-3975(95)91132-A","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"15_CR13","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1006\/inco.1997.2650","volume":"139","author":"C Frougny","year":"1997","unstructured":"Frougny, C.: On the sequentiality of the successor function. Inform. Comput. 139(1), 17\u201338 (1997). https:\/\/doi.org\/10.1006\/inco.1997.2650","journal-title":"Inform. Comput."},{"issue":"7","key":"15_CR14","doi-asserted-by":"publisher","first-page":"1547","DOI":"10.1016\/j.ejc.2012.03.017","volume":"33","author":"DA Gewurz","year":"2012","unstructured":"Gewurz, D.A., Merola, F.: Numeration and enumeration. European J. Combin. 33(7), 1547\u20131556 (2012). https:\/\/doi.org\/10.1016\/j.ejc.2012.03.017","journal-title":"European J. Combin."},{"key":"15_CR15","unstructured":"Gheeraert, F., Restivo, A., Romana, G., Sciortino, M., Stipulanti, M.: New string attractor-based complexities on infinite words (2023), work in progress"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Gheeraert, F., Romana, G., Stipulanti, M.: String attractors of fixed points of $$k$$-bonacci-like morphisms, long version available at arXiv:2302.13647 (2023)","DOI":"10.1007\/978-3-031-33180-0_15"},{"issue":"2","key":"15_CR17","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s002240000082","volume":"31","author":"M Hollander","year":"1998","unstructured":"Hollander, M.: Greedy numeration systems and regularity. Theory Comput. Syst. 31(2), 111\u2013133 (1998). https:\/\/doi.org\/10.1007\/s002240000082","journal-title":"Theory Comput. Syst."},{"key":"15_CR18","doi-asserted-by":"publisher","unstructured":"Kempa, D., Prezza, N.: At the roots of dictionary compression: string attractors. In: STOC 2018\u2013Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, pp. 827\u2013840. ACM, New York (2018). https:\/\/doi.org\/10.1145\/3188745.3188814","DOI":"10.1145\/3188745.3188814"},{"key":"15_CR19","doi-asserted-by":"publisher","unstructured":"Kutsukake, K., Matsumoto, T., Nakashima, Y., Inenaga, S., Bannai, H., Takeda, M.: On repetitiveness measures of Thue-Morse words. In: Boucher, C., Thankachan, S.V. (eds.) SPIRE 2020. vol. 12303. LNCS, pp. 213\u2013220. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-59212-7_15","DOI":"10.1007\/978-3-030-59212-7_15"},{"issue":"1","key":"15_CR20","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s002240010014","volume":"34","author":"PBA Lecomte","year":"2001","unstructured":"Lecomte, P.B.A., Rigo, M.: Numeration systems on a regular language. Theory Comput. Syst. 34(1), 27\u201344 (2001). https:\/\/doi.org\/10.1007\/s002240010014","journal-title":"Theory Comput. Syst."},{"key":"15_CR21","doi-asserted-by":"publisher","unstructured":"Lothaire, M.: Combinatorics on words. Cambridge Mathematical Library. Cambridge University Press, Cambridge (1997). https:\/\/doi.org\/10.1017\/CBO9780511566097, corrected reprint of the 1983 original","DOI":"10.1017\/CBO9780511566097,"},{"key":"15_CR22","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.tcs.2020.11.006","volume":"850","author":"S Mantaci","year":"2021","unstructured":"Mantaci, S., Restivo, A., Romana, G., Rosone, G., Sciortino, M.: A combinatorial view on string attractors. Theoret. Comput. Sci. 850, 236\u2013248 (2021). https:\/\/doi.org\/10.1016\/j.tcs.2020.11.006","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR23","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/BF02020954","volume":"11","author":"W Parry","year":"1960","unstructured":"Parry, W.: On the $$\\beta $$-expansions of real numbers. Acta Math. Acad. Sci. Hungar. 11, 401\u2013416 (1960). https:\/\/doi.org\/10.1007\/BF02020954","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"15_CR24","doi-asserted-by":"publisher","unstructured":"Restivo, A., Romana, G., Sciortino, M.: String attractors and infinite words. In: LATIN 2022: Theoretical informatics, vol. 13568. LNCS, pp. 426\u2013442. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-20624-5_26","DOI":"10.1007\/978-3-031-20624-5_26"},{"key":"15_CR25","unstructured":"Reutenauer, C.: Mots de Lyndon g\u00e9n\u00e9ralis\u00e9s. S\u00e9m. Lothar. Combin. 54, Art. B54h, 16 (2005\/07)"},{"key":"15_CR26","doi-asserted-by":"publisher","unstructured":"Rigo, M.: Formal languages, automata and numeration systems. 2. Applications to recognizability and decidability. Networks and Telecommunications Series, ISTE, London; John Wiley & Sons Inc, Hoboken, NJ (2014). https:\/\/doi.org\/10.1002\/9781119042853","DOI":"10.1002\/9781119042853"},{"key":"15_CR27","unstructured":"Schaeffer, L., Shallit, J.: String attractor for automatic sequences, preprint available at arXiv:2012.06840 (2022)"},{"key":"15_CR28","doi-asserted-by":"publisher","unstructured":"Shallit, J.: The logical approach to automatic sequences. Exploring combinatorics on words with Walnut, Lond. Math. Soc, vol. 482. Lecture Notes Series. Cambridge University Press, Cambridge (2023). https:\/\/doi.org\/10.1017\/9781108775267","DOI":"10.1017\/9781108775267"}],"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-031-33180-0_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,14]],"date-time":"2023-12-14T12:41:01Z","timestamp":1702557661000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33180-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031331794","9783031331800"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33180-0_15","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":"31 May 2023","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":"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":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cwords2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dltwords2023.cs.umu.se\/","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":"Easy chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","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":"68% - 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":"2.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":"5","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":"3 Invited papers included in this proceedings","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)"}}]}}