This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
C.V.S. Rao, Department of Electronics and Communication Engineering, Osmania University Engineering College
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
Index Terms:
Closure class, compatibility class, incomplete sequential machine, incompletely specified sequential machines, minimal closed covering, supersession of compatibles.
Citation:
C.V.S. Rao, N.N. Biswas, "Further Comments on "Closure Partition Method for Minimizing Incomplete Sequential Machines"," IEEE Transactions on Computers, vol. 25, no. 7, pp. 767-768, July 1976, doi:10.1109/TC.1976.1674690
Usage of this product signifies your acceptance of the Terms of Use.