Let us examine these teorems (16) and (17) from the standpoint of logic circuits. First, consider theorem (16),
X + y =x.y
The lefthand side of the equation can be viewed as the output of a NOR gate whose inputs are x and y. The righthand side of the equation, on the other hand, is the result of first inverting both x and y and then putting them through an AND gate. These two representations are equivalent and illustrated in Figure 326(a).
Figure 326 (a) Equivalent circuits implied by theorem (16); (b)alternative symbol for the NOR function.
Figure 327 (a) Equivalent circuits implied by theorem (17); (b) alternative symbol for the NAND function.
What this means is that an AND gate with INVERTERs on each of its inputs is equivalent to a NOR gate. In fact, both representations are used to represent the NOR function. When the AND gate with inverted inputs is used to represent the NOR function, it is usually drawn as shown in Figure 326(b), where the small circles on the inputs represent the inversion operation.
Now consider theorem (17),
X.Y=X+Y
The left side of the equation can be implemented by a NAND gate with inputs x and y. The right side can be implemented by first inverting inputs x and y and then putting them through an OR gate. These two equivalent representations are shown in Figure 327(a). The OR gate with INVERTERs on each of its inputs is equivalent to the NAND gate. In fact, both representations are used to represent the NAND function. When the OR gate with inverted inputs is used to represent the NAND function, it is usually drawn as shown in Figure 327(b), where the circles again represent inversion.

Tinggalkan Jawapan