An Algorithm for Deriving All Pairs of Compatible States by Closure Classes

Authors:
Chao-Chih Yang;Marilyn A. Tarpy
Affiliations:
Department of Information Sciences, University of Alabama in Birmingham, University Station, Birmingham, AL 35294.;Department of Information Sciences, University of Alabama in Birmingham, University Station, Birmingham, AL 35294.
Venue:
IEEE Transactions on Computers
Year:
1976

Citing 5
Cited 0

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

IEEE Transactions on Computers
A New Representation of Sequential Machines for Determining All Incompatible Pairs

IEEE Transactions on Computers
A Matrix Method for Determining All Pairs of Compatible States of a Sequential Machine

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

IEEE Transactions on Computers
Closure Partition Method for Minimizing Incomplete Sequential Machines

IEEE Transactions on Computers

Quantified Score

Hi-index	14.99

Visualization

Abstract

This correspondence proposes a new algorithm for deriving all pairs of compatible and incompatible states of any incompletely or completely specified sequential machine. The method needs a single step in checking the contents of the closure classes with respect to each pair of distinct states. A working example is given for illustrating the method by hand computation. The algorithm is implemented by a PL/I program and executed by using the incomplete machine of the example as input data on an IBM system 370/Model 158. These demonstrations assure that the algorithm is feasible and efficient for both hand computation and computer execution.