M. Almeida, N. Moreira, and R. Reis, Enumeration and generation with a string automata representation, Theoret. Comput. Sci, vol.387, issue.2, pp.93-102, 2007.

V. M. Antimirov, Partial derivatives of regular expressions and finite automaton constructions, Theoret. Comput. Sci, vol.155, issue.2, pp.291-319, 1996.

F. Bassino and C. Nicaud, Enumeration and random generation of accessible automata, Theoret. Comput. Sci, vol.381, issue.1-3, pp.86-104, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00459712

J. M. Champarnaud and T. Paranthoën, Random generation of DFAs, Theoret. Comput. Sci, vol.330, issue.2, pp.221-235, 2005.

P. Fado, FAdo: tools for formal languages manipulation, p.132018

P. Héam and J. Joly, On the uniform random generation of non deterministic automata up to isomorphism, Proc. 20th CIAA, vol.9223, pp.140-152, 2015.

D. E. Knuth, The Art of Computer Programming, Seminumerical Algorithms, vol.2, 1981.

D. A. Levin, Y. Peres, and E. L. Wilmer, Markov Chain and Mixing Times, 2008.

M. Lothaire, Applied Combinatorics on Words, 105 in Encyclopedia of Mathematics and its Applications, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00620607

C. Nicaud, Random deterministic automata, MFCS. LNCS, vol.8634, pp.5-23, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01772890