Further Comments on "Closure Partition Method for Minimizing Incomplete Sequential Machines"

In the above paper¹Yang 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.