论文信息 - A census finite automata

A census finite automata

Closed form expressions are obtained for enumerating the non-equivalent finite automata under serveral definitions of equivalence. Algorithms are presented for determining the number of connected automata and automata with a distinguished initial state. Useful lower bounds and asymptotic results are obtained.

Michael A. Harrison

[1] F. Harary. THE NUMBER OF LINEAR, DIRECTED, ROOTED, AND CONNECTED GRAPHS , 1955 .

[2] de Ng Dick Bruijn. Generalization of polya’s fundamental theorem in enumerative combinatorial analysis , 1959 .

[3] Michael A. Harrison,et al. A Census of Finite Automata , 1965, Canadian Journal of Mathematics.