Abstract
A finite automaton may be thought of as a possible abstraction of a digital computer. Imagine a tape or sequence of letters from some alphabet being fed into a device with a finite number of internal states. When the device is in a particular state and receives an input letter, the system passes to another internal state and prints a letter on an output tape. This operation is continued until the entire input sequence has been processed.Both Harary (6) and Ginsburg (4) have focused attention on the previously unsolved problem of counting the number of equivalence classes of finite automata. In the present paper, this problem is solved completely by proving a variety of theorems about the enumeration of functions.
Publisher
Canadian Mathematical Society
Cited by
29 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Enumerating transformation semigroups;Semigroup Forum;2017-04-03
2. Random Deterministic Automata;Mathematical Foundations of Computer Science 2014;2014
3. Generating Small Automata and the Černý Conjecture;Implementation and Application of Automata;2013
4. Asymptotic enumeration of Minimal Automata;LEIBNIZ INT PR INFOR;2012
5. Sets with involutions: Power group enumeration;European Journal of Combinatorics;2010-07