{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T11:56:46Z","timestamp":1776859006325,"version":"3.51.2"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030287955","type":"print"},{"value":"9783030287962","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-28796-2_7","type":"book-chapter","created":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T23:02:43Z","timestamp":1567378963000},"page":"93-105","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Repetitions in Infinite Palindrome-Rich Words"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5318-6054","authenticated-orcid":false,"given":"Aseem R.","family":"Baranwal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1197-3820","authenticated-orcid":false,"given":"Jeffrey","family":"Shallit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,9]]},"reference":[{"issue":"2","key":"7_CR1","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","volume":"75","author":"D Angluin","year":"1987","unstructured":"Angluin, D.: Learning regular sets from queries and counterexamples. Inf. Comput. 75(2), 87\u2013106 (1987)","journal-title":"Inf. Comput."},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Baranwal, A.R., Shallit, J.: Critical exponent of infinite balanced words via the Pell number system. Preprint: https:\/\/arxiv.org\/abs\/1902.00503 (2019)","DOI":"10.1007\/978-3-030-28796-2_6"},{"key":"7_CR3","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, 6455\u20136463 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1142\/S012905410400242X","volume":"15","author":"S Brlek","year":"2004","unstructured":"Brlek, S., Hamel, S., Nivat, M., Reutenauer, C.: On the palindromic complexity of infinite words. Int. J. Found. Comput. Sci. 15, 293\u2013306 (2004)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"2860","DOI":"10.1016\/j.tcs.2008.11.001","volume":"410","author":"M Bucci","year":"2009","unstructured":"Bucci, M., De Luca, A., Glen, A., Zamboni, L.Q.: A new characteristic property of rich words. Theoret. Comput. Sci. 410, 2860\u20132863 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR6","doi-asserted-by":"publisher","unstructured":"Chen, G., Puglisi, S.J., Smyth, W.F.: Fast & practical algorithms for computing all the runs in a string. In: Ma, B., Zhang, K. (eds.) CPM 2007, LNCS, vol. 4580, pp. 307\u2013315. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73437-6_31","DOI":"10.1007\/978-3-540-73437-6_31"},{"issue":"2","key":"7_CR7","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.ipl.2007.10.006","volume":"106","author":"M Crochemore","year":"2008","unstructured":"Crochemore, M., Ilie, L.: Computing longest previous factor in linear time and applications. Inform. Process. Lett. 106(2), 75\u201380 (2008)","journal-title":"Inform. Process. Lett."},{"issue":"274","key":"7_CR8","doi-asserted-by":"publisher","first-page":"1063","DOI":"10.1090\/S0025-5718-2010-02407-X","volume":"80","author":"J Currie","year":"2011","unstructured":"Currie, J., Rampersad, N.: A proof of Dejean\u2019s conjecture. Math. Comput. 80(274), 1063\u20131070 (2011)","journal-title":"Math. Comput."},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1016\/j.tcs.2008.06.009","volume":"407","author":"A de Luca","year":"2008","unstructured":"de Luca, A., Glen, A., Zamboni, L.Q.: Rich, Sturmian, and trapezoidal words. Theoret. Comput. Sci. 407, 569\u2013573 (2008)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"7_CR10","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/0097-3165(72)90011-8","volume":"13","author":"F Dejean","year":"1972","unstructured":"Dejean, F.: Sur un th\u00e9or\u00e8me de Thue. J. Combin. Theory. Ser. A 13(1), 90\u201399 (1972)","journal-title":"J. Combin. Theory. Ser. A"},{"key":"7_CR11","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. Comb. 30, 510\u2013531 (2009)","journal-title":"Eur. J. Comb."},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"908","DOI":"10.1016\/j.ipl.2010.07.018","volume":"110","author":"R Groult","year":"2010","unstructured":"Groult, R., Prieur, E., Richomme, G.: Counting distinct palindromes in a word in linear time. Inform. Process. Lett. 110, 908\u2013912 (2010)","journal-title":"Inform. Process. Lett."},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1016\/j.ipl.2016.07.001","volume":"116","author":"C Guo","year":"2016","unstructured":"Guo, C., Shallit, J., Shur, A.M.: Palindromic rich words and run-length encodings. Inform. Process. Lett. 116, 735\u2013738 (2016)","journal-title":"Inform. Process. Lett."},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)","DOI":"10.1017\/CBO9780511574931"},{"key":"7_CR15","unstructured":"Mousavi, H.: Automatic theorem proving in Walnut. Preprint: https:\/\/arxiv.org\/abs\/1603.06017 (2016)"},{"issue":"1","key":"7_CR16","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF02940581","volume":"1","author":"A Ostrowski","year":"1922","unstructured":"Ostrowski, A.: Bemerkungen zur Theorie der diophantischen Approximationen. Abh. Math. Semin. Univ. Hamburg 1(1), 77\u201398 (1922)","journal-title":"Abh. Math. Semin. Univ. Hamburg"},{"key":"7_CR17","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)","journal-title":"Discrete Math."},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Pelantov\u00e1, E., Starosta, \u0160.: Constructions of words rich in palindromes and pseudopalindromes. Discrete Math. Theoret. Comput. Sci. 18, Paper #16 (2016). https:\/\/dmtcs.episciences.org\/2202","DOI":"10.46298\/dmtcs.655"},{"key":"7_CR19","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1016\/j.tcs.2018.10.017","volume":"777","author":"Narad Rampersad","year":"2019","unstructured":"Rampersad, N., Shallit, J., Vandomme, E.: Critical exponents of infinite balanced words. Theoret. Comput, Sci. 777, 454\u2013463 (2018)","journal-title":"Theoretical Computer Science"},{"issue":"27","key":"7_CR20","doi-asserted-by":"publisher","first-page":"3010","DOI":"10.1016\/j.tcs.2010.06.020","volume":"412","author":"M Rao","year":"2011","unstructured":"Rao, M.: Last cases of Dejean\u2019s conjecture. Theoret. Comput. Sci. 412(27), 3010\u20133018 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR21","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, 196\u2013213 (1994)","journal-title":"J. Number Theory"},{"key":"7_CR22","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-319-29516-9_27","volume-title":"Combinatorial Algorithms","author":"M Rubinchik","year":"2016","unstructured":"Rubinchik, M., Shur, A.M.: EERTREE: an efficient data structure for processing palindromes in strings. In: Lipt\u00e1k, Z., Smyth, W.F. (eds.) IWOCA 2015. LNCS, vol. 9538, pp. 321\u2013333. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-29516-9_27"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Schaeffer, L., Shallit, J.: Closed, palindromic, rich, privileged, trapezoidal, and balanced words in automatic sequences. Electronic J. Combinatorics 23, 1\u201325 (2016)","DOI":"10.37236\/5752"},{"key":"7_CR24","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)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR25","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.tcs.2017.05.003","volume":"687","author":"J Vesti","year":"2017","unstructured":"Vesti, J.: Rich square-free words. Theoret. Comput. Sci. 687, 48\u201361 (2017)","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-030-28796-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T13:18:18Z","timestamp":1710249498000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-28796-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030287955","9783030287962"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-28796-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"9 August 2019","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":"Loughborough","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cwords2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/words2019.lboro.ac.uk\/","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":"34","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":"21","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":"62% - 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":"7","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)"}}]}}