The Community for Technology Leaders
Green Image
Issue No. 06 - June (1972 vol. 21)
ISSN: 0018-9340
pp: 613-614
Rainer Parchmann , Institut für Mathematik, Technische Hochschule Hannover, Hannover, Germany.
ABSTRACT
In a new theorem (proved by elementary combinatorial results) the number of nonequivalent state assignments as defined in [2] and [3] is determined. The number of nondegenerate state assignments is also computed.
INDEX TERMS
CITATION

R. Parchmann, "The Number of State Assignments for Sequential Machines," in IEEE Transactions on Computers, vol. 21, no. , pp. 613-614, 1972.
doi:10.1109/TC.1972.5009022
93 ms
(Ver 3.3 (11022016))