Figure 2-26 (view A), shows a rather complex series of gates. Through proper application of Boolean
algebra, the circuit can be simplified to the single OR gate shown in view B. Figure 2-27 shows the
simplification process and the Boolean laws and theorem used to accomplish it.
Figure 2-26. Logic simplification: A. Complex series of gates; B. Simplified single OR gate.