Comments on "The Synthesis of Binary Sequence Detectors"

In the above mentioned paper,
¹
Perlman has given a method of state assignment of binary sequence detectors on the assumption that "the BSD represents a very special class of sequential networks and may be treated accordingly." (The BSD's are in fact a special class of networks, and their flow tables are much more ordered, resulting in a comparative ease in choosing an economical assignment.) It is suggested that the assignment be taken from BRS (binary ring sequence) such that 1) successive states through which the detector progresses when the sequence is entered are made to correspond to successive subsequences; 2) an initial state is chosen whereby one of a total of r
min
delay units in the detector will track the input x at all times.