Not so many runs in strings - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2008

Not so many runs in strings


Since the work of Kolpakov and Kucherov in 1998, it is known that \rho(n), the maximal number of runs in a string, is linear in the length n of the string. A lower bound of 3/(1 + \sqrt{5}) n = 0.927 n has been given by Franek and al., and upper bounds have been recently provided by Rytter, Puglisi and al., and Crochemore and Ilie (1.6n). However, very few properties are known for the \rho(n)/n function. We show here by a simple argument that this function converges and that its limit is never reached. We further study the asymptotic behavior of the number of runs with short periods. We provide a new bound for some microruns : we show that there is no more than 0.971n runs of period at most 9 in binary strings. Finally, this technique improves the previous best known upper bound, showing that the total number of runs in a binary string of length n is below 1.52n.
Fichier principal
Vignette du fichier
giraud-lata-08.pdf (128.17 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00271630 , version 1 (09-04-2008)


  • HAL Id : inria-00271630 , version 1


Mathieu Giraud. Not so many runs in strings. 2nd International Conference on Language and Automata Theory and Applications (LATA 2008), Mar 2008, Tarragona, Spain. ⟨inria-00271630⟩
167 View
85 Download


Gmail Facebook X LinkedIn More