This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On Shift-Register Realizations of Sequential Machines and Finite-State Universal Sequential Machines
April 1968 (vol. 17 no. 4)
pp. 309-312
Abstract?It is shown that there exist finite-state universal sequential machines which are also feedback-shift-register realizable. This proves from another point of view the recently proved fact that any arbitrary sequential machine can be realized with two shift registers: one which is not always binary, stores the input, and has no feedback; and the other which is always binary, is driven from the first shift register, and has feedback. In addition, it is proved that the communication between the two shift registers can be reduced to a single binary line.
Index Terms:
Index terms?Feedback-shift-register realizability, shift-register realizability, sequential-machine realizations, universal finite-state machines.
Citation:
D.R. Haring, "On Shift-Register Realizations of Sequential Machines and Finite-State Universal Sequential Machines," IEEE Transactions on Computers, vol. 17, no. 4, pp. 309-312, April 1968, doi:10.1109/TC.1968.229382
Usage of this product signifies your acceptance of the Terms of Use.