Domaratzki, Michael; Kisman, Derek; Shallit, Jeffrey On the number of distinct languages accepted by finite automata with \(n\) states. (English) Zbl 1137.68421 J. Autom. Lang. Comb. 7, No. 4, 469-486 (2002). Summary: We give asymptotic estimates and some explicit computations for both the number of distinct languages and the number of distinct finite languages over a \(k\)-letter alphabet that are accepted by deterministic finite automata (resp. nondeterministic finite automata) with \(n\) states. Cited in 2 ReviewsCited in 20 Documents MSC: 68Q45 Formal languages and automata 05A16 Asymptotic enumeration 68R05 Combinatorics in computer science PDFBibTeX XMLCite \textit{M. Domaratzki} et al., J. Autom. Lang. Comb. 7, No. 4, 469--486 (2002; Zbl 1137.68421) Online Encyclopedia of Integer Sequences: Number of distinct minimal unary DFA’s with exactly n states. Number of distinct languages accepted by unary DFA’s with n states. Number of distinct languages accepted by unary nondeterministic finite automata of n states. Number of non-isomorphic minimal deterministic finite automata with n transient states recognizing a finite binary language.