A. Akhavi, I. Klimann, S. Lombardy, J. Mairesse, and M. Picantin, ON THE FINITENESS PROBLEM FOR AUTOMATON (SEMI)GROUPS, International Journal of Algebra and Computation, vol.22, issue.06, pp.22-2012
DOI : 10.1142/S021819671250052X

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

M. Almeida, N. Moreira, and R. Reis, EXACT GENERATION OF MINIMAL ACYCLIC DETERMINISTIC FINITE AUTOMATA, International Journal of Foundations of Computer Science, vol.19, issue.04, pp.751-765, 2008.
DOI : 10.1142/S0129054108005930

A. S. Antonenko, On transition function of mealy automata with finite growth, Matematychni Studii, vol.29, issue.1, 2008.

V. Carnino and S. De-felice, Sampling different kinds of acyclic automata using Markov chains, Theoretical Computer Science, vol.450, pp.31-42, 2012.
DOI : 10.1016/j.tcs.2012.04.025

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

M. Domaratzki, Improved bounds on the number of automata accepting finite languages, DLT'02, pp.209-219, 2002.

M. Domaratzki, D. Kisman, and J. Shallit, On the number of distinct languages accepted by finite automata with n states, Journal of Automata, Languages and Combinatorics, vol.7, issue.4, pp.469-486, 2002.

P. Flajolet and R. Sedgewick, Analytic combinatorics, Cambridge Univ. Pr, 2009.
DOI : 10.1017/CBO9780511801655

URL : https://hal.archives-ouvertes.fr/inria-00072739

P. Flajolet, P. Zimmermann, and B. V. Cutsem, A calculus for the random generation of labelled combinatorial structures, Theoretical Computer Science, vol.132, issue.1-2, pp.1-35, 1994.
DOI : 10.1016/0304-3975(94)90226-7

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

V. A. Liskovets, Exact enumeration of acyclic deterministic automata, Discrete Applied Mathematics, vol.154, issue.3, pp.537-551, 2006.
DOI : 10.1016/j.dam.2005.06.009

A. Nijenhuis and H. Wilf, Combinatorial algorithms. Computer science and applied mathematics, 1975.