{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:02Z","timestamp":1759639082366,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030794156"},{"type":"electronic","value":"9783030794163"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-79416-3_23","type":"book-chapter","created":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T18:03:46Z","timestamp":1623866626000},"page":"381-394","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Closed-Rich Words"],"prefix":"10.1007","author":[{"given":"Olga","family":"Parshina","sequence":"first","affiliation":[]},{"given":"Svetlana","family":"Puzynina","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,17]]},"reference":[{"issue":"05","key":"23_CR1","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1142\/S0129054120500288","volume":"31","author":"H Alamro","year":"2020","unstructured":"Alamro, H., Alzamel, M., Iliopoulos, C.S., Pissis, S.P., Sung, W.K., Watts, S.: Efficient identification of $$k$$-closed strings. Int. J. Found. Comput. Sci. 31(05), 595\u2013610 (2020)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"23_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/978-3-319-15579-1_29","volume-title":"Language and Automata Theory and Applications","author":"G Badkobeh","year":"2015","unstructured":"Badkobeh, G., Fici, G., Lipt\u00e1k, Z.: On the number of closed factors in a word. In: Dediu, A.-H., Formenti, E., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2015. LNCS, vol. 8977, pp. 381\u2013390. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-15579-1_29"},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.dam.2016.04.009","volume":"212","author":"G Badkobeh","year":"2016","unstructured":"Badkobeh, G., et al.: Closed factorization. Discret. Appl. Math. 212, 23\u201329 (2016)","journal-title":"Discret. Appl. Math."},{"issue":"5","key":"23_CR4","doi-asserted-by":"publisher","first-page":"1501","DOI":"10.1137\/15M1011032","volume":"46","author":"H Bannai","year":"2017","unstructured":"Bannai, H., Tomohiro, I., Inenaga, S., Nakashima, Y., Takeda, M., Tsuruta, K.: The \u201cruns\u201d theorem. SIAM J. Comput. 46(5), 1501\u20131514 (2017)","journal-title":"SIAM J. Comput."},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-319-23826-5_10","volume-title":"String Processing and Information Retrieval","author":"H Bannai","year":"2015","unstructured":"Bannai, H., et al.: Efficient algorithms for longest closed factor array. In: Iliopoulos, C., Puglisi, S., Yilmaz, E. (eds.) SPIRE 2015. LNCS, vol. 9309, pp. 95\u2013102. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23826-5_10"},{"key":"23_CR6","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":"23_CR7","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.ic.2018.04.001","volume":"260","author":"J Cassaigne","year":"2018","unstructured":"Cassaigne, J., Karhum\u00e4ki, J., Puzynina, S.: On k-abelian palindromes. Inf. Comput. 260, 89\u201398 (2018)","journal-title":"Inf. Comput."},{"issue":"27","key":"23_CR8","doi-asserted-by":"publisher","first-page":"2931","DOI":"10.1016\/j.tcs.2010.06.019","volume":"412","author":"M Crochemore","year":"2011","unstructured":"Crochemore, M., Ilie, L., Tinta, L.: The \u201cruns\u201d conjecture. Theor. Comput. Sci. 412(27), 2931\u20132941 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.dam.2014.08.016","volume":"180","author":"A Deza","year":"2015","unstructured":"Deza, A., Franek, F., Thierry, A.: How many double squares can a string contain? Discret. Appl. Math. 180, 52\u201369 (2015)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"23_CR10","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. Theor. Comput. Sci. 255(1), 539\u2013553 (2001)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20133","key":"23_CR11","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/S0012-365X(97)00029-0","volume":"179","author":"F Durand","year":"1998","unstructured":"Durand, F.: A characterization of substitutive sequences using return words. Discret. Math. 179(1\u20133), 89\u2013101 (1998)","journal-title":"Discret. Math."},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Fici, G.: A classification of trapezoidal words. In: Ambroz, P., Holub, S., Mas\u00e1kov\u00e1, Z. (eds.) Words 2011. EPTCS, vol. 63, pp. 129\u2013137 (2011)","DOI":"10.4204\/EPTCS.63.18"},{"key":"23_CR13","first-page":"140","volume":"123","author":"G Fici","year":"2017","unstructured":"Fici, G.: Open and closed words. Bull. Eur. Assoc. Theor. Comput. Sci. 123, 140\u2013149 (2017)","journal-title":"Bull. Eur. Assoc. Theor. Comput. Sci."},{"key":"23_CR14","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. Theor. Comput. Sci. 481, 1\u20138 (2013)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"23_CR15","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1006\/jcta.1997.2843","volume":"82","author":"AS Fraenkel","year":"1998","unstructured":"Fraenkel, A.S., Simpson, J.: How many squares can a string contain? J. Comb. Theor. Ser. A 82(1), 112\u2013120 (1998)","journal-title":"J. Comb. Theor. Ser. A"},{"issue":"2","key":"23_CR16","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(2), 510\u2013531 (2009)","journal-title":"Eur. J. Comb."},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Kolpakov, R.M., Kucherov, G.: Finding maximal repetitions in a word in linear time. In: FOCS 1999, pp. 596\u2013604. IEEE Computer Society (1999)","DOI":"10.1007\/3-540-48321-7_31"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Lothaire, M.: Algebraic Combinatorics on Words. Encyclopedia of Mathematics and its Applications, vol. 90. Cambridge University Press (2002)","DOI":"10.1017\/CBO9781107326019"},{"issue":"4","key":"23_CR19","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. Am. J. Math. 60(4), 815\u2013866 (1938)","journal-title":"Am. J. Math."},{"key":"23_CR20","unstructured":"Parshina, O., Postic, M.: Open and closed complexity of infinite words. arXiv:2005.06254 (2020)"},{"key":"23_CR21","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.aam.2019.02.007","volume":"107","author":"O Parshina","year":"2019","unstructured":"Parshina, O., Zamboni, L.Q.: Open and closed factors in Arnoux-Rauzy words. Adv. Appl. Math. 107, 22\u201331 (2019)","journal-title":"Adv. Appl. Math."},{"key":"23_CR22","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. Theor. Comput. Sci. 500, 57\u201367 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR23","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/BF01451594","volume":"98","author":"O Toeplitz","year":"1928","unstructured":"Toeplitz, O.: Ein beispiel zur theorie der fastperiodischen funktionen. Math. Ann. 98, 281\u2013295 (1928)","journal-title":"Math. Ann."},{"issue":"2","key":"23_CR24","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1006\/eujc.2000.0444","volume":"22","author":"L Vuillon","year":"2001","unstructured":"Vuillon, L.: A characterization of Sturmian words by return words. Eur. J. Comb. 22(2), 263\u2013275 (2001)","journal-title":"Eur. J. Comb."}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-79416-3_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,31]],"date-time":"2022-12-31T11:50:39Z","timestamp":1672487439000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-79416-3_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030794156","9783030794163"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-79416-3_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"17 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sochi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/logic.pdmi.ras.ru\/csr2021\/","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":"68","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":"28","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":"41% - 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.1","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":"9.2","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)"}}]}}