The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (1974 vol.23)
pp: 530-533
null Chao-Chih Yang , Department of Information Sciences, University of Alabama
ABSTRACT
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
29 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool