Let e1 and e2 be logical expressions. DeMorgans laws for logical expressions state that NOT(e1 AND e2)

Question:

Let e1 and e2 be logical expressions. DeMorgan’s laws for logical expressions state that

NOT(e1 AND e2) implies that (NOT e1) OR (NOT e2)

and

NOT(e1 OR e2) implies that (NOT e1) AND (NOT e2)

Use these laws to nd an equivalent expression for each of the following expressions and use MATLAB to verify the equivalence.

a. ~((x < 10) & (x >= 6))

b. ~((x == 2) | (x > 5))

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: