A symbolic method for synthesis of 2-terminal switching circuits

THE problem of synthesizing minimal switching circuits that satisfy any preassigned input condition is one that has of late received considerable attention. Analysis to date has tended to be dependent principally on methods derived from Boolean algebra. While such mathematics are not new, their development, especially as is applicable to the combinational switching problem, has not been comparable to the more familiar algebra of real numbers.