The Application of Shift Registers to Secondary State Assignment: Part I

Abstract—An algorithm, which determines whether or not an arbitrary sequential machine can be realized using a set of equal-length shift registers, is developed. When realization is possible, a basis for state assignment is also given.