The Community for Technology Leaders
RSS Icon
Issue No.02 - February (1971 vol.20)
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.
Class set, compatibility class, implication chart, maximal compatibility class, minimal cover, prime compatibility class, state table.
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, February 1971, doi:10.1109/T-C.1971.223221
23 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool