A. Aho and M. Corasick, Efficient string matching: an aid to bibliographic search, Communications of the ACM, vol.18, issue.6, pp.333-340, 1975.
DOI : 10.1145/360825.360855

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

J. Bourdon and B. Vallée, Generalized Pattern Matching Statistics, Proc. Colloquium on Mathematics and Computer Science: Algorithms, Trees, Combinatorics and Probabilities, pp.249-265, 2002.
DOI : 10.1007/978-3-0348-8211-8_15

J. Bourdon and B. Vallée, Pattern Matching Statistics on Correlated Sources, Proc. of LATIN'06, pp.224-237, 2006.
DOI : 10.1007/11682462_24
URL : https://hal.archives-ouvertes.fr/hal-00461975

M. Crochemore and W. Rytter, Jewels of Stringology, p.310, 2002.
DOI : 10.1142/4838
URL : https://hal.archives-ouvertes.fr/hal-00619795

N. Chomsky and M. Schützenberger, The algebraic theory of context-free languages, Computer Programming and Formal Languages, pp.118-161, 1963.

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

I. Goulden and D. 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

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

L. Guibas and A. 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. Odlyzko, Strings overlaps, pattern matching, and non-transitive games, J. Combin . Theory, A, issue.30, pp.108-203, 1981.

Y. 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, issue.15, pp.1265-1271, 2005.
DOI : 10.1137/1023004

]. M. Lot05 and . Lothaire, Applied Combinatorics on Words. Encyclopedia of Mathematics, 2005.

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

P. Nicodème, B. Salvy, and P. Flajolet, Motif statistics, Theoretical Computer Science, vol.287, issue.2, pp.593-618, 2002.
DOI : 10.1016/S0304-3975(01)00264-X

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

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

M. Régnier, 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

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

R. Sedgewick and P. Flajolet, An Introduction to the Analysis of Algorithms, 1996.

W. Szpankowski, Average Case Analysis of Algorithms on Sequences, Series in Discrete Mathematics and Optimization, 2001.
DOI : 10.1002/9781118032770

B. Vallée, Dynamical sources in information theory: Fundamental intervals and word prefixes, Algorithmica, vol.81, issue.2, pp.262-306, 2001.
DOI : 10.1007/BF02679622

J. Von and . Gathen, Modern Computer Algebra, 1999.

D. Wiedemann, Solving sparse linear equations over finite fields, IEEE Transactions on Information Theory, vol.32, issue.1, pp.54-62, 1986.
DOI : 10.1109/TIT.1986.1057137