This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
null Chao-Chih Yang, Department of Information Sciences, University of Alabama in Birmingham
This correspondence provides some clarifications and revision to the above-mentioned paper.1 It also presents the generalized versions of the definitions and theorems related to closure classes. These versions are applicable to arbitrary subsets of the state set of a sequential machine.
Index Terms:
Closure class, implied block, sequential machine.
Citation:
null Chao-Chih Yang, M.K. Babinski, "Comments on "Closure Partition Method for Minimizing Incomplete Sequential Machines"," IEEE Transactions on Computers, vol. 24, no. 1, pp. 106-108, Jan. 1975, doi:10.1109/T-C.1975.224090
Usage of this product signifies your acceptance of the Terms of Use.