0
$\begingroup$

I'm having trouble with the Reed-Muller Form, I'm using this notation to make it easier: + = or, * = and, ^ = xor.

This is the given expression (a + !b) * (b + !c).

a + !b = a + (b ^ 1) = a ^ b ^ 1 ^ ab ^ a

I got to (1 ^ ab ^ b) * (1 ^ bc ^ c) but I don't know what to do now.

The solution is supposed to be 1 ^ ab ^ b ^ bc ^ c.

Improve this question
$\endgroup$
1
  • 1
    $\begingroup$ What sources have you studied? Have you tried consulting textbooks that cover this? What algorithm or method did they suggest you use? We discourage "here is an exercise-style task, please show me how to solve it", as we're looking to build a high-quality archive of knowledge that will be useful to others in the future, and it seems unlikely anyone else will have exactly this same question. $\endgroup$
    – D.W. ♦
    Dec 12, 2022 at 0:40

0

Reset to default

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge that you have read and understand our privacy policy and code of conduct.

Browse other questions tagged or ask your own question.