1. Lecture Notes in Computer Science;F Bassino,2007
2. Bassino, F., David, J., Nicaud, C.: Enumeration and random generation of possibly incomplete deterministic automata. Pure Math. Appl. 19, 1–16 (2009)
3. Bassino, F., Nicaud, C.: Enumeration and random generation of accessible automata. Theor. Comput. Sci. 381(1–3), 86–104 (2007)
4. Lecture Notes in Computer Science;V Carnino,2011
5. Carayol, A., Nicaud, C.: Distribution of the number of accessible states in a random deterministic automaton. In: STACS 2012, LIPIcs, vol. 14, pp. 194–205 (2012)