G. E. Andrews, R. Askey, and R. Roy, Special Functions, 1999.

B. C. Berndt, Ramanujan's Notebook, Part I, 1985.

N. G. De-bruijn, Asymptotic Methods in Analysis, 1981.

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

. Birkhäuser, Proceedings of a colloquium organized by TU Wien, 2004.

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. Book to appear, 2005.
DOI : 10.1017/cbo9780511801655
URL : https://hal.archives-ouvertes.fr/inria-00072739

P. Nicodème, q-gram analysis and urn models, Discrete Mathematics and Theoretical Computer Science AC Proceedings of the colloquium Discrete Random Walks DRW2003, organized at IHP, pp.243-258, 2003.

G. Park and W. Szpankowski, Towards a complete characterization of tries, SIAM-ACM Symposium on Discrete Algorithms (SODA2005), pp.33-42, 2005.

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.