This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Improved Method of Prime C-Class Derivation in the State Reduction of Sequential Networks
February 1971 (vol. 20 no. 2)
pp. 229-231
The state reduction of sequential networks is achieved by selecting a minimal set of prime C-classes satisfying the cover and closure requirements. The derivation of all the C-classes and subsequent prime C-classes has been illustrated by Grasselli and Luccio [1] and relies on maximal C-class decomposition. In this note, an alternative method for deriving the prime C-classes is described. The method does not involve the maximal C-classes and is algorithmically easier to implement.
Index Terms:
Class set, compatibility class, implication chart, maximal compatibility class, minimal cover, prime compatibility class, state table.
Citation:
R.G. Bennetts, "An Improved Method of Prime C-Class Derivation in the State Reduction of Sequential Networks," IEEE Transactions on Computers, vol. 20, no. 2, pp. 229-231, Feb. 1971, doi:10.1109/T-C.1971.223221
Usage of this product signifies your acceptance of the Terms of Use.