Computational methods of minimization of multiple functions

Abstract

Abstract The article discusses computational methods for minimizing multivalued functions. The problems of the minimization of combinational circuits are investigated. An effective heuristic method intended to simplify the canonical forms of arbitrary functions was developed. The method allows to reduce the cost necessary to build a combinational circuit. The proofs of the theorem and definitions about the operation of gluing and absorption to DNF of multivalued functions in the class of disjunctive normal forms are privatized. Examples are given for applying the gluing and absorbing operation to DNF Df , we obtain abbreviated DNF Dl .