The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.02 - February (1987 vol.36)
pp: 175-184
L.D. Coraor , Department of Electrical Engineering, Pennsylvania State University
ABSTRACT
A general model of a memory-based finite-state machine architecture is introduced, the 2<sup>k</sup>- decision machine (2<sup>k</sup>- D). The classical (2<sup>n</sup>- D) and binary decision (2 - D) architectures are shown to be special cases of the 2<sup>k</sup>- D architecture. The equivalence among the 2<sup>k</sup>- D solutions for different values of k follows from the sequentialization prin
INDEX TERMS
sequentialization, Conditional transition, decision diagrams, digital system design, finite-state machines, memory-based implementation, optimization
CITATION
L.D. Coraor, P.T. Hulina, O.A. Morean, "A General Model for Memory-Based Finite-State Machines", IEEE Transactions on Computers, vol.36, no. 2, pp. 175-184, February 1987, doi:10.1109/TC.1987.1676880
32 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool