Minimization of representations of the logical function in Schaeffer and Pierce bases
Бесплатный доступ
The paper studies the representation of arbitrary logical functions in Schaeffer and Pierce bases. For this purpose, recurrent dependencies of the representation of disjunctive and conjunctive monomials in these bases were initially established. Then generalizations were made to the arbitrary logical formulas presented in the form of disjunctive and conjunctive normal forms. Estimates were obtained for the number of operations in logical formulas during the transition to the Schaeffer and Pierce bases.
Disjunctive monomial, conjunctive monomial, schaeffer's basis, pierce's basis, boolean variable, boolean function
Короткий адрес: https://sciup.org/147239235
IDR: 147239235 | DOI: 10.14529/mmph220403