The Community for Technology Leaders
Green Image
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.
Class set, compatibility class, implication chart, maximal compatibility class, minimal cover, prime compatibility class, state table.

R. Bennetts, "An Improved Method of Prime C-Class Derivation in the State Reduction of Sequential Networks," in IEEE Transactions on Computers, vol. 20, no. , pp. 229-231, 1971.
181 ms
(Ver 3.3 (11022016))