Recall from an earlier lecture that we stated that the NAND and NOR were universal logic gates. Using DeMorgan’s theorem and the Rules and laws of Boolean algebra proving this should be an easy task. Figure 1-11 shows the equivalency between the basic logic gates and their NAND logic circuits counterpart. Similarly, Figure 1-12 shows the equivalency between the basic logic gates and their NOR logic circuits counterpart.
 | Note that |
Figure 1-12 NOR Equivalent Circuits
Copyright © Adrian Als , 1999
This page was last modified: Wednesday, April 12, 2000
i.e the complement of "A NAND B" 
