The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.10 - October (1968 vol.17)
pp: 954-965
ABSTRACT
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.
INDEX TERMS
Index Terms?Equal-length registers, multiclock operation, sequential machine, shift-register memory, state assignment, transition constraints.
CITATION
D.L. Johnson, K.H. O'Keefe, "The Application of Shift Registers to Secondary State Assignment: Part I", IEEE Transactions on Computers, vol.17, no. 10, pp. 954-965, October 1968, doi:10.1109/TC.1968.226441
34 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool