How to simplify with XOR after using Quine–McCluskey's Algorithm?

Question

For my program, I need to simplify boolean expressions, and I can do this using Quine–McCluskey's algorithm, however the end result only contains NOTs, ANDs, and ORs, but no XORs, and the involvement of XORs is crucial for my program - if the result derived from the algorithm contained an expression that can be converted into an XOR, how would I go about doing that?

Thank you.

To make sure I understand what you’re saying - is your goal to convert an expression made just of AND, NOT, and OR into something as simplified as possible by introducing the XOR connective? — templatetypedef, Mar 30 '19 at 03:26

score 0 · Answer 1 · answered Mar 27 '19 at 19:43

0

I use:

def xor(x,y):
    return(not (y and x) and not (not(y or x)))

answered Mar 27 '19 at 19:43

Djaro

31
7

While this code may answer the question, providing additional context regarding how and/or why it solves the problem would improve the answer's long-term value. – undetected Selenium Mar 27 '19 at 21:23
Thank you, but that does not answer my question. I have updated it now. – flamebull5 Mar 30 '19 at 03:06

How to simplify with XOR after using Quine–McCluskey's Algorithm?

1 Answers1