Abstract
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.
Similar content being viewed by others
References
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).
McCluskey, E. J. «Minimum state sequential circuits for a restricted class of incompletely specified flow tables»,Bell System Technical J.,41, 1759–1768 (1962).
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).
Grasselli, A. «Control units for sequencing complex asynchronous operations»,IRE Trans. on Electronic Computers, 11, 483–493 (1962).
Weissman, J. «Boolean algebra, map coloring, and interconnections»,American Math. Monthly,69, 608–614 (1962).
Harary, F. andJ. Ross. «A procedure for clique detection using the group matrix»,Sociometry,20, 205–215 (1957).
Author information
Authors and Affiliations
Additional information
This work was supported in part by CNR, Comitato di Ingegneria.
Rights and permissions
About this article
Cite this article
Grasselli, A. A note on the derivation of maximal compatibility classes. Calcolo 2, 165–176 (1966). https://doi.org/10.1007/BF02575691
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02575691