1. The asymptotic number of acyclic digraphs. II;Bender;J. Combin. Theory Ser. B,1988
2. Incremental construction of minimal acyclic finite-state automata;Daciuk;Comput. Linguistics,2000
3. Improved bounds on the number of automata accepting finite languages;Domaratzki;Internat. J. Found. Comput. Sci.,2004
4. M. Domaratzki, Combinatorial interpretations of a generalization of the Genocchi numbers, J. Integer Seq. 7(3) (2004) Article 04.3.6, 11p, electronic; see also: M. Domaratzki, A generalization of the Genocchi numbers with applications to enumeration of finite automata, School of Computing Technical Report No. 2001-449, Queen's University Kingston, Canada, September 2001, MR2110777 (2005h:11031).
5. On the number of distinct languages accepted by finite automata with n states;Domaratzki;J. Autom., Lang. Combin.,2002