(definition)
Definition: Negated conjunction: 0 NAND 0 = 1, 0 NAND 1 = 1, 1 NAND 0 = 1, 1 NAND 1 = 0.
Note: NAND is equivalent to AND followed by NOT. It is of particular interest because all possible boolean functions can be built with combinations of NANDs, and a NAND gate is easily built.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 16 July SAST 2012.
HTML page formatted Tue Jul 17 08:57:04 2012.
Cite this as:
Paul E. Black, "nand", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 16 July SAST 2012. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/nand.html