This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
February 1973 (vol. 22 no. 2)
pp. 215-217
P.K. Gupta, Department of Electrical Engineering, University of Wisconsin
Existing techniques for finding minimum state covers of an incompletely specified sequential machine are streamlined to yield a single minimum cover with significantly less computation. The factor by which computation is reduced is directly proportional to the complexity of the machine.
Index Terms:
Closed set, closure condition table, compatibility class, cover chart, state minimization.
Citation:
P.K. Gupta, D.L. Dietmeyer, "Fast State Minimization of Incompletely Specified Sequential Machines," IEEE Transactions on Computers, vol. 22, no. 2, pp. 215-217, Feb. 1973, doi:10.1109/T-C.1973.223687
Usage of this product signifies your acceptance of the Terms of Use.