This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Generation of All Closed Partitions on the State Set of a Sequential Machine
May 1974 (vol. 23 no. 5)
pp. 530-533
null Chao-Chih Yang, Department of Information Sciences, University of Alabama
This correspondence provides theorems for the existence of a nontrivial closed parition on the state set of a sequential machine and offers an efficient and systematic method for generating all such partitions. The method is based on the concept of the implication or closure dependence relation among some subsets of the state set.
Index Terms:
Chain-operated class, closure class, closure dependence relation, implied block, quasi-closed set, state machine.
Citation:
null Chao-Chih Yang, "Generation of All Closed Partitions on the State Set of a Sequential Machine," IEEE Transactions on Computers, vol. 23, no. 5, pp. 530-533, May 1974, doi:10.1109/T-C.1974.223976
Usage of this product signifies your acceptance of the Terms of Use.