13. (Continued)

The logic diagrams and truth tables above prove that the parentheses

can be removed and a simplified diagram obtained when there is an

ANDed input to an AND gate or an ORed input to an OR gate.

Simplify the following Boolean expressions, using the ASSOCIATIVE

law.

a. R (ST)

c. (A+B+C) +D

b. L+ (M+R)

d. R (US) T

Integrated Publishing, Inc. |