Generation of All Closed Partitions on the State Set of a Sequential Machine

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.