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

A. Burstein and T. Mansour, Counting occurrences of some subword patterns, Discr. Math. Theor. Comp. Sci, vol.6, pp.1-1, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00958999

L. Carlitz, Restricted compositions, The Fib, Quart, vol.14, pp.254-264, 1976.

P. Flajolet, X. Gourdon, and C. Martinez, Patterns in random binary search trees, Random Structures and Algorithms, vol.11, issue.3, pp.223-244, 1997.
DOI : 10.1002/(SICI)1098-2418(199710)11:3<223::AID-RSA2>3.0.CO;2-2
URL : https://hal.archives-ouvertes.fr/inria-00073700

I. P. Goulden and D. M. Jackson, Combinatorial enumeration, 1983.

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

S. Heubach and T. Mansour, Enumeration of 3-letter patterns in compositions, Integers Elect, J. Combin. Number Theory

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

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 and H. Prodinger, Probabilistic analysis of Carlitz Compositions, Discr. Math. Theor. Comp. Sci, vol.5, pp.71-96, 2002.
URL : https://hal.archives-ouvertes.fr/hal-00958973