M. Christodoulakis, M. Christou, M. Crochemore, and C. S. Iliopoulos, Abelian borders in binary words, Discrete Applied Mathematics, vol.171, pp.141-146, 2014.
DOI : 10.1016/j.dam.2014.02.012

M. Christodoulakis, M. Christou, M. Crochemore, and C. S. Iliopoulos, On the average number of regularities in a word, Theoretical Computer Science, vol.525, pp.3-9, 2014.
DOI : 10.1016/j.tcs.2013.10.007

M. Crochemore and L. Ilie, Maximal repetitions in strings, Journal of Computer and System Sciences, vol.74, issue.5, pp.796-807, 2008.
DOI : 10.1016/j.jcss.2007.09.003
URL : https://hal.archives-ouvertes.fr/hal-00619712

M. Crochemore, L. Ilie, and L. Tinta, The ???runs??? conjecture, Theoretical Computer Science, vol.412, issue.27, pp.2931-2941, 2011.
DOI : 10.1016/j.tcs.2010.06.019
URL : https://hal.archives-ouvertes.fr/hal-00742052

P. Flajolet and R. Sedgewick, Analytic Combinatorics, 2008.
DOI : 10.1017/CBO9780511801655
URL : https://hal.archives-ouvertes.fr/inria-00072739

P. Flajolet, W. Szpankowski, and B. Vallée, Hidden word statistics, Journal of the ACM, vol.53, issue.1, pp.147-183, 2006.
DOI : 10.1145/1120582.1120586

F. Franek and Q. Yang, AN ASYMPTOTIC LOWER BOUND FOR THE MAXIMAL NUMBER OF RUNS IN A STRING, International Journal of Foundations of Computer Science, vol.1, issue.01, pp.195-203, 2008.
DOI : 10.1016/0166-218X(89)90051-6

K. Fredriksson and S. Grabowski, Average-optimal string matching, Journal of Discrete Algorithms, vol.7, issue.4, pp.579-594, 2009.
DOI : 10.1016/j.jda.2008.09.001

G. Gawrychowski, B. Kucherov, T. A. Sach, and . Starikovskaya, Computing the Longest Unbordered Substring, String Processing and Information Retrieval ? 22nd International Symposium, SPIRE 2015 Proceedings, volume 9309 of Lecture Notes in Computer Science, pp.246-257, 2015.
DOI : 10.1007/978-3-319-23826-5_24
URL : https://hal.archives-ouvertes.fr/hal-01250721

A. Glen and J. Simpson, The total run length of a word, Theoretical Computer Science, vol.501, pp.41-48, 2013.
DOI : 10.1016/j.tcs.2013.06.004

R. Kolpakov and G. Kucherov, Finding maximal repetitions in a word in linear time, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039), pp.596-604, 1999.
DOI : 10.1109/SFFCS.1999.814634
URL : https://hal.archives-ouvertes.fr/inria-00098853

W. 13-kazuhiko-kusano, A. Matsubara, A. Ishino, and . Shinohara, AVERAGE VALUE OF SUM OF EXPONENTS OF RUNS IN A STRING, International Journal of Foundations of Computer Science, vol.42, issue.06, pp.1135-1146, 2009.
DOI : 10.1016/j.ic.2007.01.007

W. Matsubara, K. Kusano, A. Ishino, H. Bannai, and A. Shinohara, New lower bounds for the maximum number of runs in a string, Proceedings of the Prague Stringology Conference, pp.140-145, 2008.

J. Simon, J. Puglisi, and . Simpson, The expected number of runs in a word, Australasian Journal of Combinatorics, vol.42, pp.45-54, 2008.

J. Simon, J. Puglisi, W. F. Simpson, and . Smyth, How many runs can a string contain? Theoretical Computer Science, pp.165-171, 2008.

W. Rytter, The number of runs in a string, Information and Computation, vol.205, issue.9, pp.1459-1469, 2007.
DOI : 10.1016/j.ic.2007.01.007
URL : https://hal.archives-ouvertes.fr/hal-00742037

J. Simpson, Modified Padovan words and the maximum number of runs in a word, Australasian Journal of Combinatorics, vol.46, pp.129-145, 2010.