@inproceedings{d21ad14e335c444d9cb3d11cf86905f6,
title = "On Closed-Rich Words",
abstract = "A word is called closed if it has a prefix which is also its suffix and there is no internal occurrences of this prefix in the word. In this paper we study the maximal number of closed factors in a word of length n. We show that it is quadratic and give lower and upper bounds for a constant.",
keywords = "Closed word, Return word, Rich word",
author = "Olga Parshina and Svetlana Puzynina",
note = "Parshina O., Puzynina S. (2021) On Closed-Rich Words. In: Santhanam R., Musatov D. (eds) Computer Science – Theory and Applications. CSR 2021. Lecture Notes in Computer Science, vol 12730. Springer, Cham. https://doi.org/10.1007/978-3-030-79416-3_23; 16th International Computer Science Symposium in Russia, CSR 2021 ; Conference date: 28-06-2021 Through 02-07-2021",
year = "2021",
doi = "10.1007/978-3-030-79416-3_23",
language = "English",
isbn = "9783030794156",
series = "Lecture Notes in Computer Science ",
publisher = "Springer Nature",
pages = "381--394",
editor = "Rahul Santhanam and Daniil Musatov",
booktitle = "Computer Science – Theory and Applications",
address = "Germany",
}