This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Every Finite-State Machine can be Simulated (Realized) by a Synchronous (Asynchronous) Binary Feedback Shift-Register Machine
February 1974 (vol. 23 no. 2)
pp. 174-178
L.S. Levy, Department of Statistics and Computer Science, University of Delaware
A theoretical model of a microprogram unit is formulated, and the relationship of this model to a form of feedback shift register is developed. The feedback shift-register machine variant has synchronous and asynchronous prototypes. The asynchronous binary feedback shift-register machines realize every fundamental mode asynchronous sequential (finite-state) machine. The synchronous feedback shift-register machine differs from the standard definition by the addition of transitional states to the usual (nontransitional) states, and a single step in the simulation is a move between nontransitional states. When synchronous feedback shift-register machines are generalized in this way, they also become universal components capable of simulating ali finite-state machines.
Index Terms:
Asynchronous realization, canonical forms, feedback shift register, finite-state machines, mictoprogramming, modular decomposition, state splitting, synchronous simulation.
Citation:
L.S. Levy, M. Freeman, "Every Finite-State Machine can be Simulated (Realized) by a Synchronous (Asynchronous) Binary Feedback Shift-Register Machine," IEEE Transactions on Computers, vol. 23, no. 2, pp. 174-178, Feb. 1974, doi:10.1109/T-C.1974.223881
Usage of this product signifies your acceptance of the Terms of Use.