Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review
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.
Original language | English |
---|---|
Title of host publication | Computer Science – Theory and Applications |
Subtitle of host publication | 16th International Computer Science Symposium in Russia, CSR 2021, Sochi, Russia, June 28–July 2, 2021, Proceedings |
Editors | Rahul Santhanam, Daniil Musatov |
Publisher | Springer Nature |
Pages | 381-394 |
Number of pages | 14 |
ISBN (Print) | 9783030794156 |
DOIs | |
State | Published - 2021 |
Event | 16th International Computer Science Symposium in Russia, CSR 2021 - Sochi, Russian Federation Duration: 28 Jun 2021 → 2 Jul 2021 |
Name | Lecture Notes in Computer Science |
---|---|
Volume | 12730 LNCS |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference | 16th International Computer Science Symposium in Russia, CSR 2021 |
---|---|
Country/Territory | Russian Federation |
City | Sochi |
Period | 28/06/21 → 2/07/21 |
ID: 86499453