This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Linear Decomposition for Sequential Machines
October 1970 (vol. 19 no. 10)
pp. 956-963
This paper considers the loop-free decomposition of nonautonomous, synchronous, deterministic, nonlinear sequential machines into linear and nonlinear component machines. Two methods are derived which generate the desired decomposition and determine the state code assignment consistent with the linear realization of a component machine. Both processes are well suited for implementation by a digital computer. One of the procedures for decomposition and code assignment is analytic (in that trial and error processes are not required) and it discovers the largest possible linear component machine. In this decomposition the linear component machine is the predecessor of the nonlinear component machine. The other method, which may require iteration in some cases, yields a decomposition in which the nonlinear machine is the predecessor of the linear machine.
Index Terms:
Decomposition of automata, linear sequential machines, modular circuits, state assignment, switching circuits.
Citation:
P.J. Marino, "A Linear Decomposition for Sequential Machines," IEEE Transactions on Computers, vol. 19, no. 10, pp. 956-963, Oct. 1970, doi:10.1109/T-C.1970.222802
Usage of this product signifies your acceptance of the Terms of Use.