On the sum of exponents of maximal repetitions in a word - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Rapport Année : 1999

On the sum of exponents of maximal repetitions in a word

Résumé

This paper continues the study presented in {KolpakovKucherovRI98}, where it was proved that the number of maximal repetitions in a word is linearly-bounded in the word length. Here we strengthen this result and prove that the sum of exponents of maximal repetitions is linearly-bounded too. Similarly to {KolpakovKucherovRI98}, we first estimate the sum of exponents of maximal repetitions in Fibonacci words. Then we prove that the sum of exponents of all maximal repetitions in general words is linearly-bounded. Finally, some algorithmic applications of this results are discussed.
Fichier principal
Vignette du fichier
99-R-034.pdf (264.25 Ko) Télécharger le fichier

Dates et versions

inria-00098792 , version 1 (26-09-2006)

Identifiants

  • HAL Id : inria-00098792 , version 1

Citer

Roman Kolpakov, Gregory Kucherov. On the sum of exponents of maximal repetitions in a word. [Intern report] 99-R-034 || kolpakov99a, 1999, 17 p. ⟨inria-00098792⟩
71 Consultations
62 Téléchargements

Partager

Gmail Facebook X LinkedIn More