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

@article{Yang1976AnAF,
  title={An Algorithm for Deriving All Pairs of Compatible States by Closure Classes},
  author={Chao-Chih Yang and Marilyn A. Tarpy},
  journal={IEEE Transactions on Computers},
  year={1976},
  volume={C-25},
  pages={202-207}
}
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… CONTINUE READING

Figures, Tables, and Topics from this paper.

Explore Further: Topics Discussed in This Paper

References

Publications referenced by this paper.
SHOWING 1-5 OF 5 REFERENCES