From the truth table of a nand gate we have following minterms:
(NOT A AND NOT B) OR (NOT A AND B) OR (A AND NOT B)=X
how can that be reduced to the nand gate bolean equation which is
NOT (A AND B)=X ?
I'm trying to get my head around how it was reduced to that?
(NOT A AND NOT B) OR (NOT A AND B) OR (A AND NOT B)=X
how can that be reduced to the nand gate bolean equation which is
NOT (A AND B)=X ?
I'm trying to get my head around how it was reduced to that?