Simplify Boolean Expession

Question

Can anyone verify this. If I can wrong can you point me in the correction direction:

$$AB'C'+A'B'C+A'BC'+AB'C = B'(AC'+A'C+AC)+A'BC' \rightarrow B'(AC'+C)+A'BC' \rightarrow B'(C+A)+A'BC'\rightarrow $B'C+B'A+A'BC'$$ (Is this correct or is it possible to do this $A'BC'=AB'C$, by NOTing it)

which then let me go further

$B'C+B'A+A'BC'\rightarrow B'(C+A+AC) \rightarrow B'(C+(A(1+C))) \rightarrow **B'(C+A)**$ (or is this correct?)

To check whether it's correct, try plugging in some values for $A,B,C$ before and after the simplification. — Greg Martin, Oct 02 '15 at 04:22
what about the notion that I am make NOTing? I that possible in Boolean? — learnmore, Oct 02 '15 at 04:28

score 0 · Accepted Answer · answered Oct 03 '15 at 19:51

An easy method to find and check the solution is the Karnaugh map:

             AB
       00  01  11  10
      +---+---+---+---+
   0  | 0 | 1 | 0 | 1 |
C     +---+---+---+---+
   1  | 1 | 0 | 0 | 1 |
      +---+---+---+---+

The map depicts the four minterms of your expression. Adjacent $1$ blocks in the map which only differ in one variable can be merged to reduce the number of terms.

Example:

$$A B' C' + A B' C = (A B')(C + C') = A B'$$

This leads to:

$$A B' + B' C + A' B C'$$

Simplify Boolean Expession

1 Answers1