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

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

P. Caron, J. Champarnaud, and L. Mignot, Small Extended Expressions for Acyclic Automata, Lecture Notes in Computer Science, vol.63, issue.1,2, pp.198-207, 2009.
DOI : 10.1016/0304-3975(96)00028-X

P. Caron, J. Champarnaud, and L. Mignot, Acyclic automata and small expressions using multi-tilde-bar operators, Theoretical Computer Science, vol.411, issue.38-39, pp.38-393423, 2010.
DOI : 10.1016/j.tcs.2010.05.023
URL : http://doi.org/10.1016/j.tcs.2010.05.023

P. Caron and D. Ziadi, Characterization of Glushkov automata, Theoretical Computer Science, vol.233, issue.1-2, pp.75-90, 2000.
DOI : 10.1016/S0304-3975(97)00296-X

J. Champarnaud and T. Paranthoën, Random generation of DFAs, Theoretical Computer Science, vol.330, issue.2, pp.221-235, 2005.
DOI : 10.1016/j.tcs.2004.03.072

P. Duchon, P. Flajolet, G. Louchard, and G. Schaeffer, Random generation of combinatorial structures: Boltzmann samplers and beyond, Proceedings of the 2011 Winter Simulation Conference (WSC), pp.577-625, 2004.
DOI : 10.1109/WSC.2011.6147745
URL : https://hal.archives-ouvertes.fr/hal-00654267

P. Flajolet, P. Zimmermann, and B. Van-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

P. Héam, C. Nicaud, and S. Schmitz, Parametric random generation of deterministic tree automata, Theoretical Computer Science, vol.411, issue.38-39, pp.38-393469, 2010.
DOI : 10.1016/j.tcs.2010.05.036

D. A. Levin, Y. Peres, and E. L. Wilmer, Markov Chains and Mixing Times, 2008.
DOI : 10.1090/mbk/058

A. Valery and . Liskovets, Exact enumeration of acyclic deterministic automata, Discrete Applied Mathematics, vol.154, issue.3, pp.537-551, 2006.

G. Melançon, I. Dutour, and M. Bousquet-mélou, Random Generation of Directed Acyclic Graphs, Electronic Notes in Discrete Mathematics, vol.10, pp.202-207, 2001.
DOI : 10.1016/S1571-0653(04)00394-4

G. Melançon and F. Philippe, Generating connected acyclic digraphs uniformly at random, Information Processing Letters, vol.90, issue.4, pp.209-213, 2004.
DOI : 10.1016/j.ipl.2003.06.002

M. Mohri, String-matching with automata, Nord. J. Comput, vol.4, issue.2, pp.217-231, 1997.

D. Revuz, Minimisation of acyclic deterministic automata in linear time, Theoretical Computer Science, vol.92, issue.1, pp.181-189, 1992.
DOI : 10.1016/0304-3975(92)90142-3
URL : https://hal.archives-ouvertes.fr/hal-00619678