DocumentCode :
959286
Title :
The Number of State Assignments for Sequential Machines
Author :
Parchmann, Rainer
Author_Institution :
Institut fÿr Mathematik, Technische Hochschule Hannover, Hannover, Germany.
Issue :
6
fYear :
1972
fDate :
6/1/1972 12:00:00 AM
Firstpage :
613
Lastpage :
614
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.
Keywords :
Frequency; Logic arrays; Mathematics; Noise generators; Notice of Violation; Passband; Random number generation; Sampling methods; Sorting; White noise; Combinatorial mathematics; sequential machines; state assignments;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/TC.1972.5009022
Filename :
5009022
Link To Document :
بازگشت