1. Bassino, F., David, J., Nicaud, C.: On the average complexity of Moore’s state minimization algorithm. In: Albers, S., Marion, J.-Y. (eds.) 26th International Symposium on Theoretical Aspects of Computer Science (STACS 2009), Freiburg, Germany. LIPIcs, vol. 3, pp. 123–134. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany (2009)
2. Bassino, F., Nicaud, C.: Enumeration and random generation of accessible automata. Theor. Comput. Sci. 381, 86–104 (2007)
3. Lecture Notes in Computer Science;J. Berstel,2005
4. Lecture Notes in Computer Science;G. Castiglione,2009
5. Gries, D.: Describing an algorithm by Hopcroft. Acta Inf. 2, 97–109 (1973)