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?
2026-04-11 21:53:43.1775944423
Reduce to lowest possible gates
27 Views Asked by user63181 https://math.techqa.club/user/user63181/detail At
1
$\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}$