Computer Science, asked by gaurav111224, 6 months ago

prove DeMorgan’s first theorem.​

Answers

Answered by Snehpriyanshu
6

Explanation:

DeMorgan's First theorem proves that when two (or more) input variables are AND'ed and negated, they are equivalent to the OR of the complements of the individual variables. Thus the equivalent of the NAND function will be a negative-OR function, proving that A.B = A+B

Similar questions