CODEWITHSUNDEEP
boolean-expressiondemorgans-law
studiosfx
studiosfx

Reputation: 23

Simplifying Boolean Expressions with DeMorgan’s law

I need help simplifying the following Boolean expressions using DeMorgan’s law:

a) [ (AB)' + (CD)' ]'

and

b) [(X+Y)' + (X+Y') ]'

Please show some steps so I can do the other ones myself

Upvotes: 2

Views: 12990

Answers (2)

Varaquilex
Varaquilex

Reputation: 3463

a) First step is the outermost negation: distribute it.

((AB)')'*((CD)')'

You see we have double negations which means the expression itself. (p')' = p therefore

ABCD

[ (AB)' + (CD)' ]'  --> ABCD

b)

Distribute the outermost negation:

((X+Y)')'(X+Y')'

get rid of the double negation:

(X+Y)(X+Y')'

again, distribute the negation (the one at the outer part of the expression):

(X+Y)(X'Y)

When you distribute (X+Y), we get

XX'Y + YX'Y

Since there is XX' in the first part of disjunction, the expression XX'Y equals to 0 (False). Multiple instances of the same thing in an expression is the same thing itself. ppp = p. Therefore: 0 + YX' --> YX'

[ (X+Y)' + (X+Y') ]' --> YX'

Im sorry for non-formal language:) hope it helps.

Upvotes: 2

Loren Abrams
Loren Abrams

Reputation: 1002

Steps are included:

a: [ (AB)' + (CD)' ]' = (AB)'' * (CD)'' = (AB) * (CD) = ABCD

b: [ (X+Y)' + (X+Y') ]' = (X+Y)'' * (X+Y')' = (X+Y) * (X'*Y) .. Simplifying this further relies on the distributive property.

Upvotes: 1

Related Questions