DocumentCode
2204240
Title
A census finite automata
Author
Harrison, Michael A.
fYear
1964
fDate
11-13 Nov. 1964
Firstpage
44
Lastpage
46
Abstract
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.
Keywords
Automata; Laboratories; Video recording;
fLanguage
English
Publisher
ieee
Conference_Titel
Switching Circuit Theory and Logical Design, 1964 Proceedings of the Fifth Annual Symposium on
Conference_Location
Princeton, NJ, USA
Type
conf
DOI
10.1109/SWCT.1964.1
Filename
4569804
Link To Document