Issue No.05 - May (1978 vol.27)
E.J. Wilkens , Interdata, Inc.
Modern large scale integration techniques, microcomputers, and programming techniques have made the classical realizations of sequential machines obsolete. These applications of sequential machines all occur in environments where random access memory, whether read-only or writable, is an extremely cost effective device. This paper presents a realization of a sequential machine which preserves the multiport branching characteristic of a sequential machine. A structure theory and a design technique are presented which allow an optimal memory size realization to be found.
state assignment, Finite-state machines, microcomputer programming, partition algebra, sequential network design
E.J. Wilkens, "Realizations of Sequential Machines Using Random Access Memory", IEEE Transactions on Computers, vol.27, no. 5, pp. 429-441, May 1978, doi:10.1109/TC.1978.1675123