Skip to Main Content
A procedure is illustrated to reduce the number of classes of internal states to be considered in the state minimization problem for incompletely specified sequential machines. The procedure leads to an extension of the definition of prime compatibility classes of states. It is based on the updating of the logical closure constraints for prime classes due to previous eliminations of nonprime ones. An additional, more complex elimination mechanism is also presented.