Derivation of Maximal Compatibles Using Boolean Algebra
Mitchell P. Marcus · IBM Journal of Research and Development · 1964
Given an incompletely specified flow table for a sequential switching function, it is desired to minimize the number of rows in that flow table, i.e., to find an equivalent minimum-row flow table. Paull and Unger1have discussed this problem in detail