Reduce to lowest possible gates

27 Views Asked by At

I am trying to reduce (¬A V ¬B) V (A ⊕ B ) to be expressed by the lowest possible number of gates. So far by expanding the XOR gate and using Demorgan's and distributive laws, I have come down to this ¬(A ∧ B) V (A V B) Is it possible to reduce this even further?

1

There are 1 best solutions below

0
On BEST ANSWER

$\overline A+\overline B +A \oplus B = \overline A+\overline B +\overline A B + A\overline B=\overline A(1+B)+\overline B(1+A)=\overline A+\overline B=\overline {AB}$