D. Aldous, Probability Approximations via the Poisson Clumping Heuristic, 1989.
DOI : 10.1007/978-1-4757-6283-9

E. A. 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

A. Edward and . Bender, Convex n-ominoes, Discrete Math, vol.8, pp.219-226, 1974.

P. Billingsley, Convergence of Probability Measures, 1968.
DOI : 10.1002/9780470316962

S. L. Campbell and C. D. Meyer, Generalized Inverse of Linear Transformations, 1979.
DOI : 10.1137/1.9780898719048

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 H. Prodinger, Level number sequences for trees, Discrete Mathematics, vol.65, issue.2, pp.149-156, 1987.
DOI : 10.1016/0012-365X(87)90137-3
URL : https://hal.archives-ouvertes.fr/inria-00076070

P. Flajolet and M. Soria, General combinatorial schemas: Gaussian limit distributions and exponential tails, Discrete Mathematics, vol.114, issue.1-3, pp.159-180, 1993.
DOI : 10.1016/0012-365X(93)90364-Y
URL : https://hal.archives-ouvertes.fr/inria-00075557

I. P. Goulden and D. M. Jackson, Combinatorial enumeration, With a foreword by Gian-Carlo Rota, Wiley-Interscience Series in Discrete Mathematics, 1983.

P. Henrici, Applied and Computational Complex Analysis, 1988.

P. Hitczenko and G. Louchard, Distinctness of compositions of an integer: A probabilistic analysis, Random Structures and Algorithms, vol.35, issue.3-4, pp.407-437, 2001.
DOI : 10.1002/rsa.10008

H. K. Hwang, Théorèmes limites pour les structures aléatoires et les fonctions arithmétiques, 1994.

H. K. Hwang, On Convergence Rates in the Central Limit Theorems for Combinatorial Structures, European Journal of Combinatorics, vol.19, issue.3, pp.329-343, 1998.
DOI : 10.1006/eujc.1997.0179

M. Kac, On the notion of recurrence in discrete stochastic processes, Bulletin of the American Mathematical Society, vol.53, issue.10, pp.1002-1019
DOI : 10.1090/S0002-9904-1947-08927-8

J. Keilson, Markov Chain Models-Rarity and Exponentiality, 1979.
DOI : 10.1007/978-1-4612-6200-8

J. G. Kemeny, J. L. Snell, and A. W. Knapp, Denumerable Markov Chains, 1966.
DOI : 10.1007/978-1-4684-9455-6

A. Knopfmacher and H. Prodinger, On Carlitz Compositions, European Journal of Combinatorics, vol.19, issue.5, pp.579-589, 1998.
DOI : 10.1006/eujc.1998.0216

G. Louchard, Probabilistic analysis of some (un)directed animals, Theoretical Computer Science, vol.159, issue.1, pp.65-79, 1996.
DOI : 10.1016/0304-3975(95)00201-4

G. Louchard, Probabilistic analysis of column-convex and directed diagonally-convex animals. Random Structures and Algorithms, pp.151-178, 1997.

G. Louchard, Probabilistic analysis of column-convex and directed diagonally-convex animals. II: Trajectories and shapes. Random Structures and Algorithms, pp.1-23, 1999.

E. T. Whittaker and G. N. Watson, A Course of Modern Analysis, 1927.