How to eliminate redundant logic term using simplification rules and expressions.

Asked Dec 12 '18 at 17:38

Active Feb 19 '21 at 02:50

Viewed 156 times

This expression is right according to Karnaugh Map

Is it possible to eliminate extra term using Boolean algebra transformation and simplification rules? In other words - what is calculation process of this expression, which eliminates extra term.

Map:

edited Dec 13 '18 at 17:41

asked Dec 12 '18 at 17:38

andreikashin

What do you mean "by combinatorics"? The Karnaugh map itself may be considered as a concept based on combinatorics. – Vincenzo Dec 12 '18 at 21:50
I mean using Boolean Algebra simplification rules – andreikashin Dec 13 '18 at 17:39
Look up the consensus theorem. – Fabio Somenzi Dec 13 '18 at 17:46
@Fabio, yes, that is the answer - thank you! – andreikashin Dec 13 '18 at 18:04
https://math.stackexchange.com/a/60724/599981 – andreikashin Dec 14 '18 at 09:44

How to eliminate redundant logic term using simplification rules and expressions.

0 Answers0