The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.06 - June (1972 vol.21)
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.
CITATION
Rainer Parchmann, "The Number of State Assignments for Sequential Machines", IEEE Transactions on Computers, vol.21, no. 6, pp. 613-614, June 1972, doi:10.1109/TC.1972.5009022
25 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool