ABSTRACT
<p>A method was presented by A.L. Ruiz, P.P. Trabado, and J.O. Lopera for efficiently generating the solutions of Boolean equations by using tables (i.e., rectangular arrays or matrices) of 0's, 1's, and dashes to represent Boolean expressions. Some enhancements of their method are presented. First, it is shown how the uniting theorem can be applied directly to simplify tables. Then it is shown how to complement a table, which would make their method (henceforth referred to as RTL) directly applicable to expressions containing complemented subexpressions. The latter result allows the method to be extended from the solution of equations of the form f(X)=1 to equations of the form f(X)=0, and, more generally to equations of the form f(X)=g(X), or to simultaneous equations of the same types.</p>
INDEX TERMS
Boolean functions; switching equations; tabular algebra; Boolean equations; Boolean expressions; complemented subexpressions.
CITATION

S. Unger, "Some Additions to "Solution of Switching Equations Based on a Tabular Algebra"," in IEEE Transactions on Computers, vol. 43, no. , pp. 365-367, 1994.
doi:10.1109/12.272437