THE ALGORITHM FOR MINIMIZING BOOLEAN FUNCTIONS USING A METHOD OF THE OPTIMAL COMBINATION OF THE SEQUENCE OF FIGURATIVE TRANSFORMATIONS

The reported study has established the possibility of improving the productivity of an algorithm for the minimization of Boolean functions using a method of the optimal combination of the sequence of logical operations applying different techniques for gluing the variables ‒ simple gluing and super-gluing. The correspondence of intervals I(α, β) in the Boolean space ẞnhas been established, given by a pair of Boolean vectors α and β, such that α≼β, with a complete combinatorial system with the repeated 2-(n, b)-designs. The internal components of the interval I(α, β) correspond to the complete 2-(n, b)-design system while external ones are determined by calculating the number of zeros or unities in the columns of the truth table of the assigned logical function. This makes it possible to use the theory of I(α, β) intervals in the mathematical apparatus of 2-(n, b)-design combinatorial systems to minimize Boolean functions by the method of equivalent figurative transformations, in particular, to perform automated search for the 2-(n, b)-design systems in the structure of a truth table. Experimental study has confirmed that the combinatorial 2-(n, b)-design system and the consistent alternation of logical operations of super-gluing the variables (if such an operation is possible) and the simple gluing of variables in the first truth table improves the efficiency of the process and the reliability of results from minimizing the Boolean functions. This simplifies algorithmizing the search for the 2-(n, b)-design system in the structure of a truth table of the assigned logical function, which would provide for the tool to further automate the search for the 2-(n, b)-design system. In comparison with analogs, it enables increasing the productivity of the Boolean function minimization process by 100–200 % by using an optimum alternation of operations of super gluing and simple gluing of variables by the method of equivalent figurative transformations. There are reasons to argue about the possibility to improve the productivity of the Boolean function minimization process by the optimal combination of the sequences of the logical operations of super-gluing the variables and the simple gluing of variables by the method of equivalent figurative transformation