On the asymptotic enumeration of accessible automata

We simplify the known formula for the asymptotic estimate of the number of deterministic and accessible automata with n states over a k-letter alphabet. The proof relies on the theory of Lagrange inversion applied in the context of generalized binomial series.

[1]  Gaston H. Gonnet,et al.  On the LambertW function , 1996, Adv. Comput. Math..

[2]  Ronald L. Graham,et al.  Concrete Mathematics, a Foundation for Computer Science , 1991, The Mathematical Gazette.

[3]  M. Heggie,et al.  An Integral Representation for the Generalized Binomial Function , 1996, Canadian Mathematical Bulletin.

[4]  Frédérique Bassino,et al.  Enumeration and random generation of accessible automata , 2007, Theor. Comput. Sci..

[5]  Frank Harary,et al.  Enumeration of Finite Automata , 1967, Inf. Control..