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 languageEnglish
Title of host publicationComputer Science – Theory and Applications
Subtitle of host publication16th International Computer Science Symposium in Russia, CSR 2021, Sochi, Russia, June 28–July 2, 2021, Proceedings
EditorsRahul Santhanam, Daniil Musatov
PublisherSpringer Nature
Pages381-394
Number of pages14
ISBN (Print)9783030794156
DOIs
StatePublished - 2021
Event16th International Computer Science Symposium in Russia, CSR 2021 - Sochi, Russian Federation
Duration: 28 Jun 20212 Jul 2021

Publication series

NameLecture Notes in Computer Science
Volume12730 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference16th International Computer Science Symposium in Russia, CSR 2021
Country/TerritoryRussian Federation
CitySochi
Period28/06/212/07/21

    Research areas

  • Closed word, Return word, Rich word

    Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

ID: 86499453