{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T01:44:32Z","timestamp":1776822272253,"version":"3.51.2"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031975479","type":"print"},{"value":"9783031975486","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-97548-6_11","type":"book-chapter","created":{"date-parts":[[2025,6,29]],"date-time":"2025-06-29T10:48:50Z","timestamp":1751194130000},"page":"116-127","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Symmetries of\u00a0Rich Sequences with\u00a0Minimum Critical Exponent"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7208-4248","authenticated-orcid":false,"given":"L\u2019ubom\u00edra","family":"Dvo\u0159\u00e1kov\u00e1","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3817-2943","authenticated-orcid":false,"given":"Edita","family":"Pelantov\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,30]]},"reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-030-28796-2_7","volume-title":"Combinatorics on Words","author":"AR Baranwal","year":"2019","unstructured":"Baranwal, A.R., Shallit, J.: Repetitions in infinite palindrome-rich words. In: Merca\u015f, R., Reidenbach, D. (eds.) WORDS 2019. LNCS, vol. 11682, pp. 93\u2013105. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-28796-2_7"},{"key":"11_CR2","doi-asserted-by":"publisher","unstructured":"Balkov\u00e1, L{\\!\u2019}, Pelantov\u00e1, E., Starosta, \u0160: Sturmian jungle (or garden?) on multiliteral alphabets. RAIRO - Theor. Inform. Appl. 44, 443\u2013470 (2010). https:\/\/doi.org\/10.1051\/ita\/2011002","DOI":"10.1051\/ita\/2011002"},{"key":"11_CR3","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. Appl. Math. 42, 60\u201374 (2009). https:\/\/doi.org\/10.1016\/j.aam.2008.03.005","journal-title":"Adv. Appl. Math."},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Currie, J. D., Mol, L., Peltom\u00e4ki, J.: The repetition threshold for ternary rich words (2024). https:\/\/arxiv.org\/abs\/2409.12068","DOI":"10.37236\/13499"},{"key":"11_CR5","doi-asserted-by":"publisher","unstructured":"Currie, J. D., Mol, L., Rampersad, N.: The repetition threshold for binary rich words. Disc. Math. Theoret. Comput. Sci. 22(1) (2020). https:\/\/doi.org\/10.23638\/DMTCS-22-1-6","DOI":"10.23638\/DMTCS-22-1-6"},{"key":"11_CR6","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, 539\u2013553 (2001). https:\/\/doi.org\/10.1016\/S0304-3975(99)00320-5","journal-title":"Theoret. Comput. Sci."},{"key":"11_CR7","doi-asserted-by":"publisher","unstructured":"Dvo\u0159\u00e1kov\u00e1, L{\\!\u2019}, Klouda, K., Pelantov\u00e1, E.: The asymptotic repetition threshold of sequences rich in palindromes. Eur. J. Comb. 126, 104124 (2025). https:\/\/doi.org\/10.1016\/j.ejc.2025.104124","DOI":"10.1016\/j.ejc.2025.104124"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1016\/j.ejc.2008.04.006","volume":"30","author":"A Glen","year":"2009","unstructured":"Glen, A., Justin, J., Widmer, S., Zamboni, L.Q.: Palindromic richness. Eur. J. Combin. 30, 510\u2013531 (2009). https:\/\/doi.org\/10.1016\/j.ejc.2008.04.006","journal-title":"Eur. J. Combin."},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"2432","DOI":"10.1016\/j.disc.2013.07.002","volume":"313","author":"E Pelantov\u00e1","year":"2013","unstructured":"Pelantov\u00e1, E., Starosta, \u0160: Languages invariant under more symmetries: overlapping factors versus palindromic richness. Discrete Math. 313, 2432\u20132445 (2013). https:\/\/doi.org\/10.1016\/j.disc.2013.07.002","journal-title":"Discrete Math."},{"key":"11_CR10","doi-asserted-by":"publisher","unstructured":"Pelantov\u00e1, E., Starosta, \u0160.: Constructions of words rich in palindromes and pseudopalindromes. DMTCS 18(3) (2016). https:\/\/doi.org\/10.46298\/dmtcs.655","DOI":"10.46298\/dmtcs.655"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.tcs.2013.07.021","volume":"518","author":"E Pelantov\u00e1","year":"2014","unstructured":"Pelantov\u00e1, E., Starosta, \u0160: Palindromic richness for languages invariant under more symmetries. Theoret. Comput. Sci. 518, 42\u201363 (2014). https:\/\/doi.org\/10.1016\/j.tcs.2013.07.021","journal-title":"Theoret. Comput. Sci."},{"key":"11_CR12","series-title":"Lecture Notes in Math","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11212-6","volume-title":"Substitution dynamical systems - Spectral analysis","author":"M Queff\u00e9lec","year":"1987","unstructured":"Queff\u00e9lec, M.: Substitution dynamical systems - Spectral analysis. Lecture Notes in Math, vol. 1294. Springer, Berlin, Heidelberg (1987). https:\/\/doi.org\/10.1007\/978-3-642-11212-6"},{"key":"11_CR13","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$$. Journal of Number Theory 46, 196\u2013213 (1994). https:\/\/doi.org\/10.1006\/jnth.1994.1012","journal-title":"Journal of Number Theory"},{"key":"11_CR14","doi-asserted-by":"publisher","unstructured":"Rozenberg, G., Salomaa, A.: The mathematical theory of L systems. In: Tou, J.T. (eds) Advances in Information Systems Science. Springer, Boston, MA (1976). https:\/\/doi.org\/10.1007\/978-1-4615-8249-6_4","DOI":"10.1007\/978-1-4615-8249-6_4"},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.tcs.2014.06.033","volume":"548","author":"J Vesti","year":"2014","unstructured":"Vesti, J.: Extensions of rich words. Theoret. Comput. Sci. 548, 14\u201324 (2014). https:\/\/doi.org\/10.1016\/j.tcs.2014.06.033","journal-title":"Theoret. Comput. Sci."}],"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-97548-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T01:21:23Z","timestamp":1776820883000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-97548-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031975479","9783031975486"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-97548-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"30 June 2025","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":"Nancy","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cwords2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/words2025.loria.fr\/en\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}