{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T08:33:28Z","timestamp":1770712408451,"version":"3.49.0"},"reference-count":92,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,8,20]],"date-time":"2025-08-20T00:00:00Z","timestamp":1755648000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,20]],"date-time":"2025-08-20T00:00:00Z","timestamp":1755648000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100004073","name":"Killam Trusts","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004073","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["2024-03725"],"award-info":[{"award-number":["2024-03725"]}],"id":[{"id":"10.13039\/501100000038","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":[[2025,9]]},"DOI":"10.1007\/s00224-025-10234-x","type":"journal-article","created":{"date-parts":[[2025,8,20]],"date-time":"2025-08-20T02:22:58Z","timestamp":1755656578000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Reflection Complexity of Sequences Over Finite Alphabets"],"prefix":"10.1007","volume":"69","author":[{"given":"Jean-Paul","family":"Allouche","sequence":"first","affiliation":[]},{"given":"John M.","family":"Campbell","sequence":"additional","affiliation":[]},{"given":"Shuo","family":"Li","sequence":"additional","affiliation":[]},{"given":"Jeffrey","family":"Shallit","sequence":"additional","affiliation":[]},{"given":"Manon","family":"Stipulanti","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,20]]},"reference":[{"issue":"2","key":"10234_CR1","doi-asserted-by":"publisher","first-page":"133","DOI":"10.36045\/bbms\/1103408543","volume":"1","author":"J-P Allouche","year":"1994","unstructured":"Allouche, J.-P.: Sur la complexit\u00e9 des suites infinies. Bull. Belg. Math. Soc. Simon Stevin 1(2), 133\u2013143 (1994)","journal-title":"Bull. Belg. Math. Soc. Simon Stevin"},{"issue":"4","key":"10234_CR2","doi-asserted-by":"publisher","first-page":"1843","DOI":"10.1063\/1.531916","volume":"38","author":"J-P Allouche","year":"1997","unstructured":"Allouche, J.-P.: Schr\u00f6dinger operators with Rudin-Shapiro potentials are not palindromic. J. Math. Phys. 38(4), 1843\u20131848 (1997)","journal-title":"J. Math. Phys."},{"key":"10234_CR3","first-page":"19","volume":"84","author":"J-P Allouche","year":"2000","unstructured":"Allouche, J.-P.: Nouveaux r\u00e9sultats de transcendance de r\u00e9els \u00e0 d\u00e9veloppement non al\u00e9atoire. Gaz. Math. 84, 19\u201334 (2000)","journal-title":"Gaz. Math."},{"issue":"1","key":"10234_CR4","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/S0304-3975(01)00212-2","volume":"292","author":"J-P Allouche","year":"2003","unstructured":"Allouche, J.-P., Baake, M., Cassaigne, J., Damanik, D.: Palindrome complexity. Theoret. Comput. Sci. 292(1), 9\u201331 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"10234_CR5","first-page":"145","volume":"1","author":"J-P Allouche","year":"1994","unstructured":"Allouche, J.-P., Bousquet-M\u00e9lou, M.: Facteurs des suites de Rudin-Shapiro g\u00e9n\u00e9ralis\u00e9es. Bull. Belg. Math. Soc. 1, 145\u2013164 (1994)","journal-title":"Bull. Belg. Math. Soc."},{"key":"10234_CR6","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1006\/eujc.1998.0206","volume":"19","author":"J-P Allouche","year":"1998","unstructured":"Allouche, J.-P., Shallit, J.: Generalized perturbed symmetry. European J. Combin. 19, 401\u2013411 (1998)","journal-title":"European J. Combin."},{"key":"10234_CR7","doi-asserted-by":"crossref","unstructured":"Allouche, J.-P., Shallit, J.: Automatic Sequences. Theory, Applications, Generalizations. Cambridge: Cambridge University Press, (2003)","DOI":"10.1017\/CBO9780511546563"},{"key":"10234_CR8","unstructured":"Allouche, J.-P., Yao, J.-Y.: Opacity complexity of automatic sequences. The general case. Preprint available at http:\/\/arxiv.org\/abs\/2404.13601 (2024)"},{"issue":"5","key":"10234_CR9","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1515\/integers-2012-0005","volume":"12","author":"H Ardal","year":"2012","unstructured":"Ardal, H., Brown, T., Jungi\u0107, V., Sahasrabudhe, J.: On abelian and additive complexity in infinite words. Integers 12(5), 795\u2013804 (2012)","journal-title":"Integers"},{"key":"10234_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.24033\/bsmf.2220","volume":"122","author":"P Arnoux","year":"1994","unstructured":"Arnoux, P., Mauduit, C., Shiokawa, I., Tamura, J.-I.: Complexity of sequences defined by billiard in the cube. Bull. Soc. Math. France 122, 1\u201312 (1994)","journal-title":"Bull. Soc. Math. France"},{"key":"10234_CR11","unstructured":"Avgustinovich, S.V.: The number of different subwords of given length in the Morse-Hedlund sequence. Sibirsk. Zh. Issled. Oper. 1(2), 3\u20137, 103, (1994)"},{"key":"10234_CR12","doi-asserted-by":"crossref","unstructured":"Avgustinovich, S.V., Fon-Der-Flaass, D.G., Frid, A.E.: Arithmetical complexity of infinite words. In: Words. languages & combinatorics, III (Kyoto, 2000), pp. 51\u201362. World Sci. Publ, River Edge, NJ (2003)","DOI":"10.1142\/9789812704979_0004"},{"issue":"3","key":"10234_CR13","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1023\/A:1007678316583","volume":"49","author":"M Baake","year":"1999","unstructured":"Baake, M.: A note on palindromicity. Lett. Math. Phys. 49(3), 217\u2013227 (1999)","journal-title":"Lett. Math. Phys."},{"issue":"3","key":"10234_CR14","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/j.tcs.2007.03.019","volume":"380","author":"P Bal\u00e1\u017ei","year":"2007","unstructured":"Bal\u00e1\u017ei, P., Mas\u00e1kov\u00e1, Z., Pelantov\u00e1, E.: Factor versus palindromic complexity of uniformly recurrent infinite words. Theoret. Comput. Sci. 380(3), 266\u2013275 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"10234_CR15","doi-asserted-by":"crossref","unstructured":"Balkov\u00e1, \u013d, Pelantov\u00e1, E., Starosta, \u0160: Sturmian jungle (or garden?) on multiliteral alphabets. RAIRO Theor. Inform. Appl. 44(4) (2010)","DOI":"10.1051\/ita\/2011002"},{"key":"10234_CR16","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/BF02099463","volume":"174","author":"Y Baryshnikov","year":"1995","unstructured":"Baryshnikov, Y.: Complexity of trajectories in rectangular billiards. Comm. Math. Phys. 174, 43\u201356 (1995)","journal-title":"Comm. Math. Phys."},{"key":"10234_CR17","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.tcs.2022.06.001","volume":"927","author":"JP Bell","year":"2022","unstructured":"Bell, J.P., Shallit, J.: Lie complexity of words. Theoret. Comput. Sci. 927, 98\u2013108 (2022)","journal-title":"Theoret. Comput. Sci."},{"key":"10234_CR18","doi-asserted-by":"crossref","unstructured":"Berstel, J.: Sturmian and episturmian words (a survey of some recent results). In: Algebraic informatics, volume 4728 of Lecture Notes in Comput. Sci., pp. 23\u201347. Springer, Berlin, (2007)","DOI":"10.1007\/978-3-540-75414-5_2"},{"key":"10234_CR19","unstructured":"Berstel, J., Boasson, L., Carton, O., Fagnot, I.: Infinite words without palindrome. Preprint available at https:\/\/arxiv.org\/abs\/0903.2382 (2009)"},{"issue":"46","key":"10234_CR20","doi-asserted-by":"publisher","first-page":"6455","DOI":"10.1016\/j.tcs.2011.08.007","volume":"412","author":"A Blondin-Mass\u00e9","year":"2011","unstructured":"Blondin-Mass\u00e9, A., Brlek, S., Labb\u00e9, S., Vuillon, L.: Palindromic complexity of codings of rotations. Theoret. Comput. Sci. 412(46), 6455\u20136463 (2011)","journal-title":"Theoret. Comput. Sci."},{"issue":"1\u20133","key":"10234_CR21","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0166-218X(92)90274-E","volume":"24","author":"S Brlek","year":"1989","unstructured":"Brlek, S.: Enumeration of factors in the Thue-Morse word. Discrete Appl. Math. 24(1\u20133), 83\u201396 (1989)","journal-title":"Discrete Appl. Math."},{"key":"10234_CR22","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0304-3975(02)00746-6","volume":"302","author":"S Brlek","year":"2003","unstructured":"Brlek, S., Ladouceur, A.: A note on differentiable palindromes. Theoret. Comput. Sci. 302, 167\u2013178 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"10234_CR23","doi-asserted-by":"crossref","unstructured":"Brlek, S., Li, S.: On the number of squares in a finite word. Combinatorial Theory, 5(1) #3, (2025)","DOI":"10.5070\/C65165014"},{"key":"10234_CR24","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1016\/j.tcs.2010.11.025","volume":"412","author":"S Brlek","year":"2011","unstructured":"Brlek, S., Reutenauer, C.: Complexity and palindromic defect of infinite words. Theoret. Comput. Sci. 412, 493\u2013497 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"10234_CR25","unstructured":"Govert, N., de Bruijn.: A combinatorial problem. Proc. Konin. Neder. Akad. Wet. 49, 758\u2013764 (1946)"},{"key":"10234_CR26","unstructured":"de Bruijn, N.G.: Acknowledgement of priority to C. Flye Sainte-Marie on the counting of circular arrangements of $$2^n$$ zeros and ones that show each $$n$$-letter word exactly once: Technical report 75-WSK-06. Eindhoven University of Technology. The Netherlands, Department of Mathematics and Computing Science (1975)"},{"issue":"1","key":"10234_CR27","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.aam.2008.03.005","volume":"42","author":"M Bucci","year":"2009","unstructured":"Bucci, M., De Luca, A., Glen, A., Zamboni, L.Q.: A connection between palindromic and factor complexity using return words. Adv. in Appl. Math. 42(1), 60\u201374 (2009)","journal-title":"Adv. in Appl. Math."},{"key":"10234_CR28","doi-asserted-by":"publisher","first-page":"3281","DOI":"10.1090\/tran\/7378","volume":"371","author":"Y Bugeaud","year":"2019","unstructured":"Bugeaud, Y., Han Kim, D.: 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."},{"issue":"44\u201346","key":"10234_CR29","doi-asserted-by":"publisher","first-page":"3932","DOI":"10.1016\/j.tcs.2010.08.005","volume":"411","author":"A Carpi","year":"2010","unstructured":"Carpi, A., D\u2019Alonzo, V.: On factors of synchronized sequences. Theoret. Comput. Sci. 411(44\u201346), 3932\u20133937 (2010)","journal-title":"Theoret. Comput. Sci."},{"key":"10234_CR30","unstructured":"Cassaigne, J.: Special factors of sequences with linear subword complexity. In: Developments in language theory. II (Magdeburg, 1995), pp. 25\u201334. World Sci. Publ, River Edge, NJ (1996)"},{"key":"10234_CR31","unstructured":"Cassaigne, J.: Sequences with grouped factors. In: Bozapalidis, S. (ed.) Proceedings of the 3rd International Conference Developments in Language Theory, DLT 1997, Thessaloniki, Greece, July 20-23, 1997, pages 211\u2013222. Aristotle University of Thessaloniki, (1997)"},{"key":"10234_CR32","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.jcta.2016.07.002","volume":"145","author":"J Cassaigne","year":"2017","unstructured":"Cassaigne, J., Fici, G., Sciortino, M., Zamboni, L.Q.: Cyclic complexity of words. J. Comb. Theory Ser. A 145, 36\u201356 (2017)","journal-title":"J. Comb. Theory Ser. A"},{"key":"10234_CR33","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)","journal-title":"J. Combin. Theory Ser. A"},{"key":"10234_CR34","first-page":"127","volume":"2","author":"J Cassaigne","year":"2010","unstructured":"Cassaigne, J., Kabor\u00e9, I., Tapsoba, T.: On a new notion of complexity on infinite words. Acta Univ. Sapientiae Math. 2, 127\u2013136 (2010)","journal-title":"Acta Univ. Sapientiae Math."},{"key":"10234_CR35","doi-asserted-by":"crossref","unstructured":"Cassaigne, J., K\u00e4rki, T., Zamboni, L.Q.: Relationally periodic sequences and subword complexity. In: Developments in language theory. 12th International Conference, DLT 2008, Kyoto, Japan, September 16\u201319, 2008. Proceedings, pp. 196\u2013205. Berlin, Springer (2008)","DOI":"10.1007\/978-3-540-85780-8_15"},{"issue":"8","key":"10234_CR36","doi-asserted-by":"publisher","first-page":"3381","DOI":"10.1090\/proc\/13589","volume":"145","author":"\u00c9 Charlier","year":"2017","unstructured":"Charlier, \u00c9., Puzynina, S., Zamboni, L.Q.: On a group theoretic generalization of the Morse-Hedlund theorem. Proc. Amer. Math. Soc. 145(8), 3381\u20133394 (2017)","journal-title":"Proc. Amer. Math. Soc."},{"key":"10234_CR37","unstructured":"Chernyat\u2019ev, A.L.: Words with a minimal growth function. Vestnik Moskov. Univ. Ser. I Mat. Mekh. 6, 42\u201344, 78\u201379 (2008)"},{"key":"10234_CR38","volume-title":"Fonction de complexit\u00e9 en facteurs et un th\u00e9or\u00e8me de Pansiot","author":"C Cisternino","year":"2018","unstructured":"Cisternino, C.: Fonction de complexit\u00e9 en facteurs et un th\u00e9or\u00e8me de Pansiot. Universit\u00e9 de Li\u00e8ge, Belgique, M\u00e9moire de Master (2018)"},{"key":"10234_CR39","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1137\/050646846","volume":"21","author":"S Constantinescu","year":"2007","unstructured":"Constantinescu, S., Ilie, L.: The Lempel-Ziv complexity of fixed points of morphisms. SIAM J. Discrete Math. 21, 466\u2013481 (2007)","journal-title":"SIAM J. Discrete Math."},{"key":"10234_CR40","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/BF01780584","volume":"8","author":"EM Coven","year":"1975","unstructured":"Coven, E.M.: Sequences with minimal block growth. II. Math. Syst. Theory 8, 376\u2013382 (1975)","journal-title":"Math. Syst. Theory"},{"key":"10234_CR41","first-page":"115","volume":"90","author":"D Damanik","year":"2003","unstructured":"Damanik, D., Lenz, D.: Uniform spectral properties of one-dimensional quasicrystals. IV. Quasi-Sturmian potentials. J. Anal. Math. 90, 115\u2013139 (2003)","journal-title":"Quasi-Sturmian potentials. J. Anal. Math."},{"issue":"3","key":"10234_CR42","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(89)90013-3","volume":"63","author":"A de Luca","year":"1989","unstructured":"de Luca, A., Varricchio, S.: Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups. Theoret. Comput. Sci. 63(3), 333\u2013348 (1989)","journal-title":"Theoret. Comput. Sci."},{"key":"10234_CR43","unstructured":"Dekking, F.M.: On the structure of self-generating sequences. In: S\u00e9minaire de Th\u00e9orie des Nombres, Bordeaux, 1980\u20131981. Univ. Bordeaux I, Talence. Exp. No. 31, pp. 6 (1981)"},{"key":"10234_CR44","doi-asserted-by":"crossref","unstructured":"Deviatov, R.: On subword complexity of morphic sequences. In: Computer science\u2014theory and applications, volume 5010 of Lecture Notes in Comput. Sci., pp. 146\u2013157. Springer, Berlin, (2008)","DOI":"10.1007\/978-3-540-79709-8_17"},{"issue":"2","key":"10234_CR45","doi-asserted-by":"publisher","first-page":"211","DOI":"10.17323\/1609-4514-2018-18-2-211-303","volume":"18","author":"R Devyatov","year":"2018","unstructured":"Devyatov, R.: On factor complexity of morphic sequences. Mosc. Math. J. 18(2), 211\u2013303 (2018)","journal-title":"Mosc. Math. J."},{"issue":"1\u20132","key":"10234_CR46","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1016\/S0304-3975(99)00320-5","volume":"255","author":"X Droubay","year":"2001","unstructured":"Droubay, X., Justin, J., Pirillo, G.: Episturmian words and some constructions of de Luca and Rauzy. Theoret. Comput. Sci. 255(1\u20132), 539\u2013553 (2001)","journal-title":"Theoret. Comput. Sci."},{"issue":"1\u20132","key":"10234_CR47","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/S0304-3975(97)00188-6","volume":"223","author":"X Droubay","year":"1999","unstructured":"Droubay, X., Pirillo, G.: Palindromes and Sturmian words. Theoret. Comput. Sci. 223(1\u20132), 73\u201385 (1999)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"10234_CR48","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1023\/A:1008295603824","volume":"10","author":"D Erdmann","year":"1997","unstructured":"Erdmann, D., Murphy, S.: An approximate distribution for the maximum order complexity. Des. Codes Cryptography 10(3), 325\u2013339 (1997)","journal-title":"Des. Codes Cryptography"},{"issue":"2","key":"10234_CR49","doi-asserted-by":"publisher","first-page":"271","DOI":"10.24033\/bsmf.2260","volume":"123","author":"S Ferenczi","year":"1995","unstructured":"Ferenczi, S.: Les transformations de Chacon: Combinatoire, structure g\u00e9om\u00e9trique, lien avec les syst\u00e8mes de complexit\u00e9 $$2n + 1$$. Bull. Soc. Math. Fr. 123(2), 271\u2013292 (1995)","journal-title":"Bull. Soc. Math. Fr."},{"issue":"1\u20133","key":"10234_CR50","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S0012-365X(98)00400-2","volume":"206","author":"S Ferenczi","year":"1999","unstructured":"Ferenczi, S.: Complexity of sequences and dynamical systems. Discrete Math. 206(1\u20133), 145\u2013154 (1999)","journal-title":"Discrete Math."},{"issue":"1","key":"10234_CR51","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0304-3975(98)00258-8","volume":"218","author":"S Ferenczi","year":"1999","unstructured":"Ferenczi, S., K\u00e1sa, Z.: Complexity for finite factors of infinite sequences. Theoret. Comput. Sci. 218(1), 177\u2013195 (1999)","journal-title":"Theoret. Comput. Sci."},{"key":"10234_CR52","doi-asserted-by":"crossref","unstructured":"Fici, G., Puzynina, S.: Abelian combinatorics on words: A survey. Comput. Sci. Rev. 47, 21 (2023). Id\/No 100532","DOI":"10.1016\/j.cosrev.2022.100532"},{"key":"10234_CR53","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2013.02.013","volume":"481","author":"G Fici","year":"2013","unstructured":"Fici, G., Zamboni, L.Q.: On the least number of palindromes contained in an infinite word. Theoret. Comput. Sci. 481, 1\u20138 (2013)","journal-title":"Theoret. Comput. Sci."},{"key":"10234_CR54","unstructured":"Sainte-Marie, C.F.: Solution to question nr. 48. L\u2019Interm\u00e9diaire des Math. 1, 107\u2013110, (1894)"},{"issue":"3","key":"10234_CR55","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1051\/ita\/2009003","volume":"43","author":"A Glen","year":"2009","unstructured":"Glen, A., Justin, J.: Episturmian words: A survey. RAIRO Theor. Inform. Appl. 43(3), 403\u2013442 (2009)","journal-title":"RAIRO Theor. Inform. Appl."},{"key":"10234_CR56","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1364\/JOSA.39.000437","volume":"39","author":"MJE Golay","year":"1949","unstructured":"Golay, M.J.E.: Multi-slit spectrometry. J. Optical Society Amer. 39, 437\u2013444 (1949)","journal-title":"J. Optical Society Amer."},{"key":"10234_CR57","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1364\/JOSA.41.000468","volume":"41","author":"MJE Golay","year":"1951","unstructured":"Golay, M.J.E.: Static multislit spectrometry and its application to the panoramic display of infrared spectra. J. Optical Society Amer. 41, 468\u2013472 (1951)","journal-title":"J. Optical Society Amer."},{"key":"10234_CR58","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/BF02099468","volume":"174","author":"A Hof","year":"1995","unstructured":"Hof, A., Knill, O., Simon, B.: Singular continuous spectrum for palindromic Schr\u00f6dinger operators. Comm. Math. Phys. 174, 149\u2013159 (1995)","journal-title":"Comm. Math. Phys."},{"issue":"4","key":"10234_CR59","doi-asserted-by":"publisher","first-page":"1191","DOI":"10.1017\/S014338570200055X","volume":"22","author":"T Kamae","year":"2002","unstructured":"Kamae, T., Zamboni, L.: Sequence entropy and the maximal pattern complexity of infinite words. Ergodic Theory Dyn. Syst. 22(4), 1191\u20131199 (2002)","journal-title":"Ergodic Theory Dyn. Syst."},{"issue":"8","key":"10234_CR60","doi-asserted-by":"publisher","first-page":"2189","DOI":"10.1016\/j.jcta.2013.08.008","volume":"120","author":"J Karhumaki","year":"2013","unstructured":"Karhumaki, J., Saarela, A., Zamboni, L.Q.: On a generalization of abelian equivalence and complexity of infinite words. J. Comb. Theory Ser. A 120(8), 2189\u20132206 (2013)","journal-title":"J. Comb. Theory Ser. A"},{"key":"10234_CR61","first-page":"369","volume":"25","author":"A Kolmogorov","year":"1963","unstructured":"Kolmogorov, A.: On tables of random numbers. Sankhy\u0101 Ser. A 25, 369\u2013376 (1963)","journal-title":"Sankhy\u0101 Ser. A"},{"key":"10234_CR62","unstructured":"Krawchuk, C., Rampersad, N.: Cyclic complexity of some infinite words and generalizations. Integers, 18A:#A12, (2018)"},{"key":"10234_CR63","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1109\/TIT.1976.1055501","volume":"22","author":"A Lempel","year":"1976","unstructured":"Lempel, A., Ziv, J.: On the complexity of finite sequences. IEEE Trans. Inf. Theory 22, 75\u201381 (1976)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10234_CR64","doi-asserted-by":"crossref","unstructured":"Li, S., Pachocki, J., Radoszewski, J.: A note on the maximum number of $$k$$-powers in a finite word. Electron. J. Combin. 31(3), P.3.14 (2024)","DOI":"10.37236\/11270"},{"key":"10234_CR65","doi-asserted-by":"crossref","unstructured":"Lothaire, M.: Combinatorics on words. Cambridge Mathematical Library. Cambridge University Press, Cambridge (1997)","DOI":"10.1017\/CBO9780511566097"},{"key":"10234_CR66","doi-asserted-by":"crossref","unstructured":"Lothaire, M.: Algebraic combinatorics on words, volume\u00a090 of Encycl. Math. Appl. Cambridge: Cambridge University Press, (2002)","DOI":"10.1017\/CBO9781107326019"},{"key":"10234_CR67","doi-asserted-by":"crossref","unstructured":"Luchinin, S., Puzynina, S.: Sequences of symmetry groups of infinite words. Discrete Math. 346(1), Paper No. 113171, 15, (2023)","DOI":"10.1016\/j.disc.2022.113171"},{"key":"10234_CR68","unstructured":"Medkov\u00e1, K.: Return words and derivated sequences to Rote sequences. Available at https:\/\/www.labri.fr\/perso\/vdelecro\/jm2018\/215749.pdf (2018)"},{"key":"10234_CR69","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1051\/ita\/2019004","volume":"53","author":"K Medkov\u00e1","year":"2019","unstructured":"Medkov\u00e1, K., Pelantov\u00e1, E., Vuillon, L.: Derived sequences of complementary symmetric Rote sequences. RAIRO Theor. Inform. Appl. 53, 125\u2013151 (2019)","journal-title":"RAIRO Theor. Inform. Appl."},{"key":"10234_CR70","doi-asserted-by":"publisher","first-page":"963","DOI":"10.1142\/S0218196713400080","volume":"23","author":"F Mignosi","year":"2013","unstructured":"Mignosi, F., Restivo, A.: A new complexity function for words based on periodicity. Internat. J. Algebra Comput. 23, 963\u2013987 (2013)","journal-title":"Internat. J. Algebra Comput."},{"key":"10234_CR71","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.tcs.2011.11.013","volume":"420","author":"TK Subrahmonian Moothathu","year":"2012","unstructured":"Subrahmonian Moothathu, T.K.: Eulerian entropy and non-repetitive subword complexity. Theoret. Comput. Sci. 420, 80\u201388 (2012)","journal-title":"Theoret. Comput. Sci."},{"key":"10234_CR72","doi-asserted-by":"publisher","first-page":"815","DOI":"10.2307\/2371264","volume":"60","author":"M Morse","year":"1938","unstructured":"Morse, M., Hedlund, G.A.: Symbolic dynamics. Amer. J. Math. 60, 815\u2013866 (1938)","journal-title":"Amer. J. Math."},{"issue":"1\u20132","key":"10234_CR73","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1016\/j.tcs.2007.10.015","volume":"389","author":"Y Moshe","year":"2007","unstructured":"Moshe, Y.: On the subword complexity of Thue-Morse polynomial extractions. Theoret. Comput. Sci. 389(1\u20132), 318\u2013329 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"10234_CR74","unstructured":"Mousavi, H.: Automatic theorem proving in Walnut. Preprint available at https:\/\/arxiv.org\/abs\/1603.06017 (2016)"},{"key":"10234_CR75","doi-asserted-by":"crossref","unstructured":"Niederreiter, H.: Linear complexity and related complexity measures for sequences. In: Progress in Cryptology\u2013 INDOCRYPT 2003. 4th International Conference on Cryptology in India, New Delhi, India, December 8\u201310, 2003. Proceedings, pp. 1\u201317. Berlin, Springer (2003)","DOI":"10.1007\/978-3-540-24582-7_1"},{"key":"10234_CR76","doi-asserted-by":"crossref","unstructured":"Pansiot, J.-J.: Complexit\u00e9 des facteurs des mots infinis engendr\u00e9s par morphismes it\u00e9r\u00e9s. In: Automata, languages and programming (Antwerp, 1984), volume 172 of Lecture Notes in Comput. Sci., pp. 380\u2013389. Springer, Berlin (1984)","DOI":"10.1007\/3-540-13345-3_34"},{"key":"10234_CR77","unstructured":"Parshina, O., Postic, M.: Open and closed complexity of infinite words. Preprint available at https:\/\/arxiv.org\/abs\/2005.06254 (2020)"},{"key":"10234_CR78","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/BF01780578","volume":"8","author":"ME Paul","year":"1975","unstructured":"Paul, M.E.: Minimal symbolic flows having minimal block growth. Math. Systems Theory 8, 309\u2013315 (1975)","journal-title":"Math. Systems Theory"},{"key":"10234_CR79","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.tcs.2013.05.028","volume":"500","author":"J Peltom\u00e4ki","year":"2013","unstructured":"Peltom\u00e4ki, J.: Introducing privileged words: privileged complexity of Sturmian words. Theoret. Comput. Sci. 500, 57\u201367 (2013)","journal-title":"Theoret. Comput. Sci."},{"key":"10234_CR80","first-page":"157","volume":"54","author":"N Rampersad","year":"2005","unstructured":"Rampersad, N., Shallit, J.: Words avoiding reversed subwords. J. Comb. Math. Comb. Comput. 54, 157\u2013164 (2005)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"10234_CR81","unstructured":"Rauzy, G.: Suites \u00e0 termes dans un alphabet fini. In: S\u00e9minaire de Th\u00e9orie des Nombres, Bordeaux. Univ. Bordeaux I, Talence, 1982\u20131983. Exp. No. 25, pp. 16"},{"issue":"3","key":"10234_CR82","first-page":"351","volume":"7","author":"M Rigo","year":"2002","unstructured":"Rigo, M., Maes, A.: More on generalized automatic sequences. J. Autom. Lang. Comb. 7(3), 351\u2013376 (2002)","journal-title":"J. Autom. Lang. Comb."},{"key":"10234_CR83","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)","journal-title":"Theoret. Comput. Sci."},{"key":"10234_CR84","doi-asserted-by":"crossref","unstructured":"Rigo, M., Stipulanti, M., Whiteland, M.: Gapped binomial complexities in sequences. In: IEEE International Symposium on Information Theory (ISIT), Tapai, Taiwan, pp. 1294\u20131299. IEEE, (2023)","DOI":"10.1109\/ISIT54713.2023.10206676"},{"issue":"2","key":"10234_CR85","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1006\/jnth.1994.1012","volume":"46","author":"G Rote","year":"1994","unstructured":"Rote, G.: Sequences with subword complexity $$2n$$. J. Number Theory 46(2), 196\u2013213 (1994)","journal-title":"J. Number Theory"},{"key":"10234_CR86","doi-asserted-by":"publisher","first-page":"855","DOI":"10.1090\/S0002-9939-1959-0116184-5","volume":"10","author":"W Rudin","year":"1959","unstructured":"Rudin, W.: Some theorems on Fourier coefficients. Proc. Amer. Math. Soc. 10, 855\u2013859 (1959)","journal-title":"Proc. Amer. Math. Soc."},{"key":"10234_CR87","doi-asserted-by":"crossref","unstructured":"Rukavicka, J.: Upper bound for palindromic and factor complexity of rich words. RAIRO Theor. Inform. Appl. 55:1,15 (2021)","DOI":"10.1051\/ita\/2020008"},{"key":"10234_CR88","unstructured":"Schaeffer, L., Shallit, J.: String attractors for automatic sequences. Preprint available at https:\/\/arxiv.org\/abs\/2012.06840 (2021)"},{"issue":"1","key":"10234_CR89","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(88)90103-X","volume":"61","author":"J Shallit","year":"1988","unstructured":"Shallit, J.: A generalization of automatic sequences. Theoret. Comput. Sci. 61(1), 1\u201316 (1988)","journal-title":"Theoret. Comput. Sci."},{"key":"10234_CR90","doi-asserted-by":"crossref","unstructured":"Shallit, J.: The Logical Approach to Automatic Sequences-Exploring Combinatorics on Words with Walnut. London Mathematical Society Lecture Note Series, vol. 482. Cambridge University Press, Cambridge (2023)","DOI":"10.1017\/9781108775267"},{"key":"10234_CR91","unstructured":"Shapiro, H.S.: Extremal problems for polynomials and power series. Master\u2019s thesis, MIT, (1952)"},{"key":"10234_CR92","unstructured":"Sloane, N.J.A., et\u00a0al.: The On-Line Encyclopedia of Integer Sequences. Available at https:\/\/oeis.org (2024)"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-025-10234-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00224-025-10234-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-025-10234-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T08:06:15Z","timestamp":1759305975000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00224-025-10234-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,20]]},"references-count":92,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["10234"],"URL":"https:\/\/doi.org\/10.1007\/s00224-025-10234-x","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8,20]]},"assertion":[{"value":"27 July 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 August 2025","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"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"}}],"article-number":"31"}}