1964 Proceedings of the Fifth Annual Symposium on Switching Circuit Theory and Logical Design (1964)
Nov. 11, 1964 to Nov. 13, 1964
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SWCT.1964.1
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.
M. A. Harrison, "A census finite automata," 1964 Proceedings of the Fifth Annual Symposium on Switching Circuit Theory and Logical Design(FOCS), vol. 00, no. , pp. 44-46, 1964.