F. Bassino and C. Nicaud, Enumeration and random generation of accessible automata, Theoretical Computer Science, vol.381, issue.1-3, pp.86-104, 2007.
DOI : 10.1016/j.tcs.2007.04.001

URL : https://hal.archives-ouvertes.fr/hal-00459712

R. M. Corless, G. H. Gonnet, D. E. Hare, D. J. Jeffrey, and D. E. Knuth, On the LambertW function, Advances in Computational Mathematics, vol.1, issue.6, pp.329-359, 1996.
DOI : 10.1007/BF02124750

R. L. Graham, D. E. Knuth, and O. Patashnik, Concrete Mathematics: A Foundation for Computer Science, Computers in Physics, vol.3, issue.5, 1994.
DOI : 10.1063/1.4822863

M. Heggie and G. R. Nicklason, An integral representation for the generalized binomial function, Bulletin canadien de math??matiques, vol.39, issue.1, pp.59-67, 1996.
DOI : 10.4153/CMB-1996-008-4

P. Henrici, Applied and computational complex analysis Reprint of the 1974 original, 1988.

D. Korshunov, Enumeration of finite automata, Probl. Kibern, vol.34, pp.5-82, 1978.

G. Pólya and G. Szeg?-o, Problems and theorems in analysis, vol. I. Translated from the German by D. Aeppli, 1998.