A. De-luca and A. Colosimo, Special factors in biological strings, J. Theoretical Biology, vol.204, issue.118, pp.29-46, 2000.

J. Allouche, Sur la complexité des suites infinies, Bull. Belg. Math. Soc, vol.1, pp.133-143, 1994.

E. Bender and F. Kochman, The Distribution of Subword Counts is Usually Normal, European Journal of Combinatorics, vol.14, issue.4, pp.265-275, 1993.
DOI : 10.1006/eujc.1993.1030

I. Gheorghiciuc, M. Daniel-warddl99, and ]. A. De-luca, On the combinatorics of finite words, Theoretical Computer Science, vol.218, pp.13-39, 1999.

J. Fayolle, An Average-Case Analysis of Basic Parameters of the Suffix Tree, Mathematics and Computer Science, pp.217-227, 2004.
DOI : 10.1007/978-3-0348-7915-6_22

]. S. Fer99 and . Ferenczi, Complexity of sequences and dynamical systems, Discr. Math, vol.206, pp.145-154, 1999.

P. Flajolet, X. Gourdon, and P. Dumas, Mellin transforms and asymptotics: Harmonic sums, Theoretical Computer Science, vol.144, issue.1-2, pp.3-58, 1995.
DOI : 10.1016/0304-3975(95)00002-E
URL : https://hal.archives-ouvertes.fr/inria-00074307

D. [. Goulden and . Jackson, An Inversion Theorem for Cluster Decompositions of Sequences with Distinguished Subsequences, Journal of the London Mathematical Society, vol.2, issue.3, pp.567-576, 1979.
DOI : 10.1112/jlms/s2-20.3.567

L. Guibas and A. M. Odlyzko, Maximal Prefix-Synchronized Codes, SIAM Journal on Applied Mathematics, vol.35, issue.2, pp.401-418, 1978.
DOI : 10.1137/0135034

L. Guibas and A. M. Odlyzko, Periods in strings, Journal of Combinatorial Theory, Series A, vol.30, issue.1, pp.19-42, 1981.
DOI : 10.1016/0097-3165(81)90038-8

L. Guibas and A. M. Odlyzko, String overlaps, pattern matching, and nontransitive games, Journal of Combinatorial Theory, Series A, vol.30, issue.2, pp.183-208, 1981.
DOI : 10.1016/0097-3165(81)90005-4
URL : http://doi.org/10.1016/0097-3165(81)90005-4

T. [. Halava, L. Harju, and . Ilie, Periods and Binary Words, Journal of Combinatorial Theory, Series A, vol.89, issue.2, pp.298-303, 2000.
DOI : 10.1006/jcta.1999.3014
URL : http://doi.org/10.1006/jcta.1999.3014

S. [. Janson, W. Lonardi, and . Szpankowski, On the average sequence complexity, Data Compression Conference, 2004. Proceedings. DCC 2004, pp.213-227, 2004.
DOI : 10.1109/DCC.2004.1281518

W. [. Jacquet and . Szpankowski, Autocorrelation on words and its applications, Journal of Combinatorial Theory, Series A, vol.66, issue.2, pp.237-269, 1994.
DOI : 10.1016/0097-3165(94)90065-5
URL : https://hal.archives-ouvertes.fr/inria-00075453

P. Jacquet and W. Szpankowski, Applied Combinatorics on Words, Analytic Approach to Pattern Matching. Cambridge, 2005. See (Lot05)

]. Y. Kon05 and . Kong, Extension of Goulden-Jackson cluster method on pattern occurrences in random sequences and comparison with Régnier-Szpankowski method, Journal of Difference Equations and Applications, vol.11, pp.1265-1271, 2005.

]. R. Li80 and . Li, A martingale approach to the study of occurrence of sequence patterns in repeated experiments, Ann. Probab, vol.8, pp.1171-1176, 1980.

M. Lothaire, Applied Combinatorics on Words, 2005.
DOI : 10.1017/CBO9781107341005
URL : https://hal.archives-ouvertes.fr/hal-00620607

]. P. Nic03 and . Nicodème, Regexpcount, a symbolic package for counting problems on regular expressions and words, Fundamenta Informaticae, vol.56, pp.71-88, 2003.

J. Noonan and D. Zeilberger, The Goulden???Jackson cluster method: extensions, applications and implementations, Journal of Difference Equations and Applications, vol.7, issue.4-5, pp.355-377, 1999.
DOI : 10.1016/0097-3165(81)90005-4

H. [. Park, P. Hwang, W. Nicodème, and . Szpankowski, Profiles of tries, 2006.

M. Régnier and A. Denise, Rare events and conditional events on random strings, Discrete Mathematics and Theoretical Computer Science, vol.6, pp.191-214, 2004.

E. [. Rahmann and . Rivals, On the Distribution of the Number of Missing Words in Random Texts, Combinatorics, Probability and Computing, vol.12, issue.01, pp.73-87, 2003.
DOI : 10.1017/S0963548302005473
URL : https://hal.archives-ouvertes.fr/lirmm-00269581

M. Régnier and W. Szpankowski, On pattern frequency occurrences in a Markovian sequence, Proceedings of IEEE International Symposium on Information Theory, pp.631-649, 1998.
DOI : 10.1109/ISIT.1997.613234

]. A. Sol66, Solov'ev. A combinatorial identity and its application to the problem concerning the first occurrence of a rare event, Theory Prob. Appl, vol.11, pp.276-282, 1966.

W. Szpankowski, Average Case Analysis of Algorithms on Sequences, 2001.
DOI : 10.1002/9781118032770

. G. Tak-+-02-]-o, O. Troyanskaya, Y. Arbell, G. M. Koren, A. Landau et al., Sequence complexity profiles of prokaryotic genomic sequences: a fast algorithm for calculating linguistic complexity, Bioinformatics, vol.18, pp.679-688, 2002.

]. M. War07 and . Ward, The average profile of suffix trees, The Fourth Workshop on Analytic Algorithmics and Combinatorics, pp.183-193, 2007.