论文信息 - On finding maximum compatibles

On finding maximum compatibles

A method is presented for deriving the maximum compatibility sets corresponding to a given flow table. The method uses the graph of incompatibles to find the compatibility sets, and is particularly convenient when the number of pairwise incompatibles in a flow table is much less than the number of pairwise compatibles.

S. R. Das | C. L. Sheng

[1] Antonio Grasselli. Minimal Closed Partitions for Incompletely Specified Flow Tables , 1966, IEEE Trans. Electron. Comput..

[2] Stephen H. Unger,et al. Minimizing the Number of States in Incompletely Specified Sequential Switching Functions , 1959, IRE Trans. Electron. Comput..

[3] Edward J. McCluskey. Minimum-state sequential circuits for a restricted class of incompletely specified flow tables , 1962 .

[4] R. Narasimhan,et al. Minimizing Incompletely Specified Sequential Switching Functions , 1961, IRE Trans. Electron. Comput..

[5] Fabrizio Luccio,et al. A Method for Minimizing the Number of Internal States in Incompletely Specified Sequential Networks , 1965, IEEE Trans. Electron. Comput..