On The Number of Symmetry Types of Boolean Functions of n Variables

Abstract

In recent years Boolean Algebra has come to play a prominent role in the analysis and synthesis of switching circuits [1; 4]. One general synthesis problem in which this algebra has proved useful is the following. Let there be given n input leads each of which can assume one of two possible states. It is desired to construct a network with these n input leads and a single output lead also capable of assuming either of two states. Furthermore, the state of the output lead for each of the 2n states of the input leads is prescribed.