The Number of State Assignments for Sequential Machines
R. Parchmann · IEEE Transactions on Computers · 1972
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.