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

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

L. Ilie, S. Yu, and K. Zhang, Repetition Complexity of Words, Proc. COCOON 320?329, 2002.
DOI : 10.1007/3-540-45655-4_35

P. Jacquet, Common words between two random strings, 2007 IEEE International Symposium on Information Theory, pp.1495-1499, 2007.
DOI : 10.1109/ISIT.2007.4557431
URL : https://hal.archives-ouvertes.fr/inria-00071368

P. Jacquet and W. 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, Analytical depoissonization and its applications, Theoretical Computer Science, vol.201, issue.1-2, pp.1-62, 1998.
DOI : 10.1016/S0304-3975(97)00167-9

P. Jacquet and W. Szpankowski, Analytic Pattern Matching: DNA, Lempel-Ziv, and Trees, 2012.
DOI : 10.1017/CBO9780511843204

P. Jacquet, W. Szpankowski, and J. Tang, Average Profile of the Lempel-Ziv Parsing Scheme for a Markovian Source, Algorithmica, vol.31, issue.3, pp.318-360, 2001.
DOI : 10.1007/s00453-001-0053-3

M. Li and P. Vitanyi, Introduction to Kolmogorov Complexity and its Applications, 1993.
DOI : 10.1007/978-0-387-49820-1

H. Niederreiter, Some Computable Complexity Measures for Binary Sequences, pp.67-78, 1999.
DOI : 10.1007/978-1-4471-0551-0_5