, Volume 14, Issue 3, pp 213-218

Maximum compatible classes from compatibility matrices

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


A fast algorithm for the computation of maximum compatible classes (mcc) among the internal states of an incompletely specified sequential machine is presented in this paper. All the maximum compatible classes are determined by processing compatibility matrices of progressingly diminishing order, whose total number does not exceed (p + m), wherep is the largest cardinality among these classes, andm is the number of such classes. Consequently the algorithm is specially suitable for the state minimization of very large sequential machines as encountered invlsi circuits and systems.