A. , A. And-corasick, and M. , Efficient String Matching: An Aid to Bibliographic Search, Communications of the ACM, vol.18, pp.333-340, 1975.

E. Bender, Central and local limit theorems applied to asymptotic enumeration, Journal of Combinatorial Theory, Series A, vol.15, issue.1, pp.91-111, 1973.
DOI : 10.1016/0097-3165(73)90038-1
URL : http://doi.org/10.1016/0097-3165(73)90038-1

E. Bender, . And, 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

E. Bender and B. And-richmond, Central and local limit theorems applied to asymptotic enumeration II: Multivariate generating functions, Journal of Combinatorial Theory, Series A, vol.34, issue.3, pp.255-265, 1983.
DOI : 10.1016/0097-3165(83)90062-6

E. Bender, B. Richmond, and G. And-williamson, Central and local limit theorems applied to asymptotic enumeration. III. Matrix recursions, Journal of Combinatorial Theory, Series A, vol.35, issue.3, pp.264-278, 1983.
DOI : 10.1016/0097-3165(83)90012-2

B. , J. And, and B. Valléevall´vallée, Generalized pattern matching statistics, Proc. Colloquium on Mathematics and Computer Science: Algorithms, Trees, Combinatorics and Probabilities. Birkhauser, Trends in Mathematics, pp.249-265, 2002.

B. , J. And, and B. Valléevall´vallée, Pattern matching statistics on correlated sources, Proc. of LATIN'06, pp.224-237, 2006.

C. , N. And, and M. Sch¨utzenberger, The algebraic theory of context-free languages. Computer Programming and Formal Languages, pp.118-161, 1963.

C. , M. Hancart, C. And-lecroq, and T. , Algorithms on Strings, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00470109

C. , M. And-rytter, and W. , Jewels of Stringology, 2002.

E. , A. And-zeilberger, and D. , The Goulden-Jackson method for cyclic words, Advances in Applied Mathematics, vol.25, issue.2, pp.228-232, 2000.

F. , P. And, and R. Sedgewick, Analytic Combinatorics, 2009.

G. , I. Jackson, and D. , An inversion theorem for clusters decompositions of sequences with distinguished subsequences, J. London Math. Soc, vol.2, issue.20, pp.567-576, 1979.

G. , I. Jackson, and D. , Combinatorial Enumeration, 1983.

G. , L. And, and A. Odlyzko, Periods in strings, J. Combin. Theory A, vol.30, pp.19-42, 1981.

G. , L. And, and A. Odlyzko, Strings overlaps, pattern matching, and non-transitive games, J. Combin. Theory A, vol.30, pp.108-203, 1981.

J. , P. And, and W. Szpankowski, Autocorrelation on words and its applications Analysis of Suffix Trees by String Ruler Approach, J. Combin. Theory A, vol.66, pp.237-269, 1994.

K. , E. And-yuster, and D. , Generalizations of the Goulden-Jackson method, Journal of Difference Equations and Applications, vol.16, issue.12, pp.1463-1480, 2010.

P. Nicod-`-emenicod-`-nicod-`-eme, Regexpcount, a symbolic package for counting problems on regular expressions and words, Fundamenta Informaticae, vol.56, pp.1-2, 2003.

P. Nicod-`-emenicod-`-nicod-`-eme, B. Salvy, and P. And-flajolet, Motif statistics, Motif statistics, pp.593-618, 2002.
DOI : 10.1016/S0304-3975(01)00264-X

N. , J. And-zeilberger, and D. , The Goulden-Jackson Method: Extensions, Applications and Implementations, J. of Difference Equations and Applications, vol.5, pp.4-5, 1999.

P. , B. , R. , F. And-de-turckheim, and E. , Finding words with unexpected frequencies in deoxyribonucleic acid sequences, J. R. Statist. Soc. B, vol.57, issue.1, pp.205-220, 1995.

R. Egnier and M. , A unified approach to word occurrence probabilities, Discrete Applied Mathematics, vol.104, issue.1-3, pp.259-280, 2000.
DOI : 10.1016/S0166-218X(00)00195-5

R. Egnier, M. And, and W. Szpankowski, On the approximate pattern occurrences in a text, SE- QUENCES '97: Proceedings of the Compression and Complexity of Sequences, p.253, 1997.

R. Egnier, M. And, and W. Szpankowski, On Pattern Frequency Occurrences in a Markovian Sequence, Algorithmica, vol.22, issue.4, pp.631-649, 1998.
DOI : 10.1007/PL00009244

R. , G. And, and . Schbath, Compound Poisson and Poisson process approximations for occurrences of multiple words in Markov chains, J. Comp. Biol, vol.5, pp.223-253, 1998.

R. , G. Schbath, S. And, and M. Waterman, Probabilistic and statistical properties of words: an overview, J. Comp. Biol, vol.7, pp.1-46, 2000.

R. , E. And, and S. Schbath, Improved compound Poisson approximation for the number of occurrences of multiple words in a stationary Markov chain, Adv. Appl. Prob, vol.39, pp.1-13, 2007.

S. , R. And-flajolet, and P. , An Introduction to the Analysis of Algorithms, 1996.