In the above paper1Yang has expounded a concept of supersession and has claimed that superseded compatibles can be ignored in the process of minimizing incompletely specified sequential machines (ISSM). In this correspondence, we present a counterexample whose minimal solution must include a superseded compatible and not the superseding compatible. As a consequence of this it is evident that Yang's theory lacks generality.

A simple yet efficient method for the minimization of incompletely specified sequential machines (ISSM's) is proposed. Precise theorems are developed, as a consequence of which several compatibles can be deleted from consideration at the very first stage in the search for a minimal closed cover. Thus, the computational work is significantly reduced. Initial cardinality of the minimal closed cover is further reduced by a consideration of the maximal compatibles (MC's) only; as a result the method converges to the solution faster than the existing procedures. "Rank" of a compatible is defined. It is shown that ordering the compatibles, in accordance with their rank, reduces the number of comparisons to be made in the search for exclusion of compatibles. The new method is simple, systematic, and programmable. It does not involve any heuristics or intuitive procedures. For small- and medium-sized machines, it can be used for hand computation as well. For one of the illustrative examples used in this paper, 30 out of 40 compatibles can be ignored in accordance with the proposed rules and the remaining 10 compatibles only need be considered for obtaining a minimal solution.