IMPROVED BOUNDS ON THE NUMBER OF AUTOMATA ACCEPTING FINITE LANGUAGES
Michael Domaratzki · International Journal of Foundations of Computer Science · 2004
We improve the known bounds on the number of pairwise non-isomorphic minimal deterministic finite automata (DFAs) on n states which accept finite languages. The lower bound constructions are iterative approaches which yield recurrence relations.