Issue No.05 - May (1974 vol.23)
S.P. Kartashev , Department of Computer Science, University of Nebraska
This paper considers a state assignment which permits one to obtain two different realizations of a sequential machine (sm). First, as a result of this assignment we obtain a double shift-register realization of an sm by means of p pairs of shift-registers, each pair of registers having the same number of stages a<inf>i</inf>(i = 1,...,p). Such realizations are called multiple-variable-length-shif
Cyclic sequences, iterative realization of a sequential machine (sm), linear transform, shift-register realization, state assignment, upper bounds (ub's) of state code length.
S.P. Kartashev, "Theory and Implementation of p-Multiple Sequential Machines", IEEE Transactions on Computers, vol.23, no. 5, pp. 500-523, May 1974, doi:10.1109/T-C.1974.223973