Algebraic Topological Methods for the Synthesis of Switching Systems—Part III: Minimization of Nonsingular Boolean Trees

An algorithm is given for solving a general problem in combinational switching-circuit minimization theory. The circuits considered consist of a disjunction (OR-ing together) of trees of any set of logical elements, with the restriction that in any given tree no input appears more than once. To each logical element is attached a positive cost. A method is presented for designing a minimum-cost circuit of this variety for any given logical function. Two parallel treatments are given, one viewing it as an abstract mathematical problem, the other considering it as an engineering problem.