This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Next-State Equations of Asynchronous Sequential Machines
April 1972 (vol. 21 no. 4)
pp. 397-399
Gabriele Saucier, Laboratory of Applied Mathematics, University of Grenoble, Grenoble, France.
A theorem and two applications are given here to solve the problem of selecting state assignments of asynchronous machines. The assignment has to produce a set of simple next-state equations. The proofs use the algebraic structures defined by Hartmanis. A first illustration is given by Liu's encoding; likewise, Tracey's selection theorems are easily found again and placed in a more general context.
Citation:
Gabriele Saucier, "Next-State Equations of Asynchronous Sequential Machines," IEEE Transactions on Computers, vol. 21, no. 4, pp. 397-399, April 1972, doi:10.1109/TC.1972.5008984
Usage of this product signifies your acceptance of the Terms of Use.