This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
February 1987 (vol. 36 no. 2)
pp. 175-184
L.D. Coraor, Department of Electrical Engineering, Pennsylvania State University
A general model of a memory-based finite-state machine architecture is introduced, the 2k- decision machine (2k- D). The classical (2n- D) and binary decision (2 - D) architectures are shown to be special cases of the 2k- D architecture. The equivalence among the 2k- 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, Feb. 1987, doi:10.1109/TC.1987.1676880
Usage of this product signifies your acceptance of the Terms of Use.