An algorithm for determining the maximal compatibility classes of a compatibility relation is proposed in this paper. The algorithm consists of a simple recursive procedure which operates on the compatibility table. The ALGOL implementation of the procedure is illustrated in an Appendix.
Logical Product Complete Subgraph Compatibility Relation Array Position Compatibility Class
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.
Paull, M. C. andS. H. Unger «Minimizing the number of states in incompletely specified sequential switching functions»IRE Trans. on Electronic Computers,8, 356 357 (1959).CrossRefGoogle Scholar
McCluskey, E. J. «Minimum state sequential circuits for a restricted class of incompletely specified flow tables»,Bell System Technical J.,41, 1759–1768 (1962).Google Scholar
Grasselli, A. andF. Luccio. «A method for minimizing the number of internal states in incompletely specified sequential networks»,IEEE Trans. on Electronic Computers,14, 350–359 (1965).zbMATHCrossRefGoogle Scholar
Grasselli, A. «Control units for sequencing complex asynchronous operations»,IRE Trans. on Electronic Computers, 11, 483–493 (1962).MathSciNetGoogle Scholar