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

Authors:
Chao-Chih Yang
Affiliations:
Department of Information Sciences, University of Alabama
Venue:
IEEE Transactions on Computers
Year:
1974

Citing 2
Cited 2

Algebraic structure theory of sequential machines (Prentice-Hall international series in applied mathematics)

Algebraic structure theory of sequential machines (Prentice-Hall international series in applied mathematics)
Closure Partition Method for Minimizing Incomplete Sequential Machines

IEEE Transactions on Computers

Comments on "Closure Partition Method for Minimizing Incomplete Sequential Machines"

IEEE Transactions on Computers
Structural Preserving Morphisms of Finite Automata and an Application to Graph Isomorphism

IEEE Transactions on Computers

Quantified Score

Hi-index	14.99

Visualization

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.