1. Câmpeanu, C., Păun, A.: The number of similarity relations and the number of minimal deterministic finite cover automata. In Champarnaud, J.M., Maurel, D., eds.: Pre-Proceedings of the Seventh International Conference on Implementation and Application of Automata. (2002) 71–80
2. Domaratzki, M.: Improved bounds on the number of automata accepting finite languages. In Ito, M., Toyama, M., eds.: DLT 2002: Developments in Language Theory, Sixth International Conference. (2002) 159–181
3. Domaratzki, M., Kisman, D., Shallit, J.: On the number of distinct languages accepted by finite automata with n states. To appear, J. Automata, Languages and Combinatorics 7 (2002) 469–486
4. Liskovets, V.: Exact enumeration of acyclic automata. To appear, Formal Power Series and Algebraic Combinatorics 2003 (2003)
5. Perrin, D., Pin, J.E.: Infinite Words. Available electronically at http://www.liafa.jussieu.fr/~jep/Resumes/InfiniteWords.html (2003)