Issue No. 07 - July (1976 vol. 25)
C.V.S. Rao , Department of Electronics and Communication Engineering, Osmania University Engineering College
In the above paper<sup>1</sup>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
Closure class, compatibility class, incomplete sequential machine, incompletely specified sequential machines, minimal closed covering, supersession of compatibles.
C. Rao and N. Biswas, "Further Comments on "Closure Partition Method for Minimizing Incomplete Sequential Machines"," in IEEE Transactions on Computers, vol. 25, no. , pp. 767-768, 1976.