Boolean Algebra for Switching Circuits

摘要

Automatic switching circuits can become sufficiently complex to require tedious labor to determine the simplest and least expensive arrangement of relay contacts and supplementary components. Many such switching problems are adaptable to a Boolean algebra procedure that will greatly reduce the time required for a solution. For our purpose here any one specified output from a block box that has one input and contains any combination of a series and/or parallel contact arrangements will be either the same as the input or entirely unrelated to the input. Arbitrarily the first case will have the output 1 the latter case will have the output 0, contacts will be shown in their arbitrarily chosen initial condition, equations will usually reflect the opposite condition. (Author)