{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T14:27:03Z","timestamp":1774448823889,"version":"3.50.1"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T00:00:00Z","timestamp":1725926400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T00:00:00Z","timestamp":1725926400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100021856","name":"Ministero dell\u2019Universit\u00e1 e della Ricerca","doi-asserted-by":"publisher","award":["2022YRB97K"],"award-info":[{"award-number":["2022YRB97K"]}],"id":[{"id":"10.13039\/501100021856","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002661","name":"Fonds De La Recherche Scientifique - FNRS","doi-asserted-by":"publisher","award":["1.C.104.24F"],"award-info":[{"award-number":["1.C.104.24F"]}],"id":[{"id":"10.13039\/501100002661","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s00224-024-10195-7","type":"journal-article","created":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T06:02:32Z","timestamp":1725948152000},"page":"1601-1621","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["String Attractors of Some Simple-Parry Automatic Sequences"],"prefix":"10.1007","volume":"68","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":[[2024,9,10]]},"reference":[{"key":"10195_CR1","doi-asserted-by":"publisher","unstructured":"Kempa, D., Prezza, N.: At the roots of dictionary compression: string attractors. In: STOC\u201918\u2014Proceedings 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":"10195_CR2","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/J.TCS.2018.09.007","volume":"762","author":"G Navarro","year":"2019","unstructured":"Navarro, G., Prezza, N.: Universal compressed text indexing. Theor. Comput. Sci. 762, 41\u201350 (2019). https:\/\/doi.org\/10.1016\/J.TCS.2018.09.007","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"10195_CR3","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1145\/3426473","volume":"17","author":"AR Christiansen","year":"2021","unstructured":"Christiansen, A.R., Ettienne, M.B., Kociumaka, T., Navarro, G., Prezza, N.: Optimal-time dictionary-compressed indexes. ACM Trans. Algorithms 17(1), 8\u20131839 (2021)","journal-title":"ACM Trans. Algorithms"},{"issue":"4","key":"10195_CR4","doi-asserted-by":"publisher","first-page":"2074","DOI":"10.1109\/tit.2022.3224382","volume":"69","author":"T Kociumaka","year":"2023","unstructured":"Kociumaka, T., Navarro, G., Prezza, N.: Toward a definitive compressibility measure for repetitive sequences. IEEE Trans. Inform. Theory. 69(4), 2074\u20132092 (2023). https:\/\/doi.org\/10.1109\/tit.2022.3224382","journal-title":"IEEE Trans. Inform. Theory."},{"key":"10195_CR5","unstructured":"Schaeffer, L., Shallit, J.: String attractor for automatic sequences (2022). Preprint available at arxiv:2012.06840"},{"key":"10195_CR6","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: String Processing and Information Retrieval. Lecture Notes in Comput. Sci., vol. 12303, 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"},{"key":"10195_CR7","doi-asserted-by":"publisher","unstructured":"Dolce, F.: String attractors for factors of the Thue-Morse word. In: Combinatorics on Words. Lecture Notes in Comput. Sci., vol. 13899, pp. 117\u2013129. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-33180-0_9","DOI":"10.1007\/978-3-031-33180-0_9"},{"key":"10195_CR8","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":"10195_CR9","doi-asserted-by":"publisher","unstructured":"Restivo, A., Romana, G., Sciortino, M.: String attractors and infinite words. In: LATIN 2022: Theoretical Informatics. Lecture Notes in Comput. Sci., vol. 13568, 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":"10195_CR10","doi-asserted-by":"publisher","first-page":"114341","DOI":"10.1016\/j.tcs.2023.114341","volume":"986","author":"\u013d Dvo\u0159\u00e1kov\u00e1","year":"2024","unstructured":"Dvo\u0159\u00e1kov\u00e1, \u013d: String attractors of episturmian sequences. Theoret. Comput. Sci. 986, 114341 (2024). https:\/\/doi.org\/10.1016\/j.tcs.2023.114341","journal-title":"Theoret. Comput. Sci."},{"key":"10195_CR11","doi-asserted-by":"publisher","first-page":"105936","DOI":"10.1016\/j.jcta.2024.105936","volume":"208","author":"J Cassaigne","year":"2024","unstructured":"Cassaigne, J., Gheeraert, F., Restivo, A., Romana, G., Sciortino, M., Stipulanti, M.: New string attractor-based complexities for infinite words. J. Combin. Theory Ser. A. 208, 105936 (2024). https:\/\/doi.org\/10.1016\/j.jcta.2024.105936","journal-title":"J. Combin. Theory Ser. A."},{"key":"10195_CR12","doi-asserted-by":"crossref","unstructured":"Dvo\u0159\u00e1kov\u00e1, \u013d., Hendrychov\u00e1, V.: String attractors of Rote sequences (2023). Preprint available at arxiv:2308.00850","DOI":"10.2139\/ssrn.4564690"},{"key":"10195_CR13","unstructured":"B\u00e9aur, P., Gheeraert, F., Menibus, B.: String attractors and bi-infinite words (2024). Preprint available at arxiv:2403.13449"},{"key":"10195_CR14","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/BF01762232","volume":"7","author":"EM Coven","year":"1973","unstructured":"Coven, E.M., Hedlund, G.A.: Sequences with minimal block growth. Math. Systems Theory. 7, 138\u2013153 (1973). https:\/\/doi.org\/10.1007\/BF01762232","journal-title":"Math. Systems Theory."},{"key":"10195_CR15","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.tcs.2015.07.025","volume":"601","author":"M Rigo","year":"2015","unstructured":"Rigo, M., Salimov, P.: Another generalization of abelian equivalence: binomial complexity of infinite words. Theoret. Comput. Sci. 601, 47\u201357 (2015). https:\/\/doi.org\/10.1016\/j.tcs.2015.07.025","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"10195_CR16","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":"3\u20134","key":"10195_CR17","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":"10195_CR18","unstructured":"Thurston, W.P.: Groups, tilings, and finite state automata summer 1989 AMS colloquium lectures (version 1.5, July 20, 1989). In: Collected Works of William P. Thurston with Commentary. Vol. II. 3-manifolds, Complexity and Geometric Group theory, pp. 553\u2013602. Amer. Math. Soc., Providence, RI (2022). 1989 preprint"},{"key":"10195_CR19","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."},{"issue":"30","key":"10195_CR20","doi-asserted-by":"publisher","first-page":"6449","DOI":"10.1088\/0305-4470\/31\/30\/011","volume":"31","author":"\u010c Burd\u00edk","year":"1998","unstructured":"Burd\u00edk, \u010c, Frougny, C., Gazeau, J.P., Krejcar, R.: Beta-integers as natural counting systems for quasicrystals. J. Phys. A. 31(30), 6449\u20136472 (1998). https:\/\/doi.org\/10.1088\/0305-4470\/31\/30\/011","journal-title":"J. Phys. A."},{"issue":"2","key":"10195_CR21","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1051\/ita:2004009","volume":"38","author":"C Frougny","year":"2004","unstructured":"Frougny, C., Mas\u00e1kov\u00e1, Z., Pelantov\u00e1, E.: Complexity of infinite words associated with beta-expansions. Theor. Inform. Appl. 38(2), 163\u2013185 (2004). https:\/\/doi.org\/10.1051\/ita:2004009","journal-title":"Theor. Inform. Appl."},{"key":"10195_CR22","doi-asserted-by":"crossref","unstructured":"Ambro\u017e, P., Mas\u00e1kov\u00e1, Z., Pelantov\u00e1, E., Frougny, C.: Palindromic complexity of infinite words associated with simple Parry numbers. vol. 56, pp. 2131\u20132160 (2006). Num\u00e9ration, pavages, substitutions. http:\/\/aif.cedram.org\/item?id=AIF_2006__56_7_2131_0","DOI":"10.5802\/aif.2236"},{"key":"10195_CR23","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.tcs.2014.11.024","volume":"566","author":"O Turek","year":"2015","unstructured":"Turek, O.: Abelian properties of Parry words. Theoret. Comput. Sci. 566, 26\u201338 (2015). https:\/\/doi.org\/10.1016\/j.tcs.2014.11.024","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10195_CR24","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. and Comput. 139(1), 17\u201338 (1997). https:\/\/doi.org\/10.1006\/inco.1997.2650","journal-title":"Inform. and Comput."},{"key":"10195_CR25","doi-asserted-by":"publisher","unstructured":"Shallit, J.: The Logical Approach to Automatic Sequences: Exploring Combinatorics on Words with Walnut. London Mathematical Society Lecture Note Series, vol. 482, p. 358. Cambridge University Press, Cambridge (2023). https:\/\/doi.org\/10.1017\/9781108775267","DOI":"10.1017\/9781108775267"},{"key":"10195_CR26","doi-asserted-by":"publisher","unstructured":"Gheeraert, F., Romana, G., Stipulanti, M.: String attractors of fixed points of k-Bonacci-like morphisms. In: Combinatorics on Words. Lecture Notes in Comput. Sci., vol. 13899, pp. 192\u2013205. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-33180-0_15","DOI":"10.1007\/978-3-031-33180-0_15"},{"key":"10195_CR27","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"},{"issue":"68","key":"10195_CR28","doi-asserted-by":"publisher","first-page":"81","DOI":"10.2307\/1970044","volume":"2","author":"K-T Chen","year":"1958","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","journal-title":"Ann. of Math."},{"key":"10195_CR29","unstructured":"Reutenauer, C.: Mots de Lyndon g\u00e9n\u00e9ralis\u00e9s. S\u00e9m. Lothar. Combin. 54, 54\u201316 (2005\/07)"},{"issue":"7","key":"10195_CR30","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":"10195_CR31","doi-asserted-by":"publisher","unstructured":"Bonizzoni, P., De\u00a0Felice, 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","DOI":"10.1016\/j.aam.2018.08.005"},{"key":"10195_CR32","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":"10195_CR33","doi-asserted-by":"crossref","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)","DOI":"10.1002\/9781119042853"},{"issue":"11","key":"10195_CR34","doi-asserted-by":"publisher","first-page":"2261","DOI":"10.1016\/j.disc.2006.09.054","volume":"308","author":"J-P Duval","year":"2008","unstructured":"Duval, J.-P., Harju, T., Nowotka, D.: Unbordered factors and Lyndon words. Discret. Math. 308(11), 2261\u20132264 (2008). https:\/\/doi.org\/10.1016\/j.disc.2006.09.054","journal-title":"Discret. Math."},{"issue":"4","key":"10195_CR35","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/0196-6774(83)90017-2","volume":"4","author":"J-P Duval","year":"1983","unstructured":"Duval, J.-P.: Factorizing words over an ordered alphabet. J. Algorithms 4(4), 363\u2013381 (1983). https:\/\/doi.org\/10.1016\/0196-6774(83)90017-2","journal-title":"J. Algorithms"},{"issue":"2","key":"10195_CR36","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1051\/ita\/1980140201811","volume":"14","author":"J-P 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."},{"issue":"1\u20132","key":"10195_CR37","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.tcs.2007.07.001","volume":"389","author":"J Bernat","year":"2007","unstructured":"Bernat, J., Mas\u00e1kov\u00e1, Z., Pelantov\u00e1, E.: On a class of infinite words with affine factor complexity. Theoret. Comput. Sci. 389(1\u20132), 12\u201325 (2007). https:\/\/doi.org\/10.1016\/j.tcs.2007.07.001","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-024-10195-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00224-024-10195-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-024-10195-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,14]],"date-time":"2024-12-14T06:02:27Z","timestamp":1734156147000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00224-024-10195-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,10]]},"references-count":37,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["10195"],"URL":"https:\/\/doi.org\/10.1007\/s00224-024-10195-7","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,9,10]]},"assertion":[{"value":"12 August 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 September 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"All authors certify that they have no affiliations with or involvement in any organization or entity with any financial interest or non-financial interest in the subject matter or materials discussed in this manuscript.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}]}}