[Solved] Equality for two simple expressions with only bitwise operations


You can do this using a Karnaugh Map. Given the truth table for z ^ (x & (y ^ z)), the Karnaugh map is:

Karnaugh Map

As can be seen, you can make two groups from the diagram, giving you (x & y) | (~x & z)

1

solved Equality for two simple expressions with only bitwise operations