This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: be applied to any logical expression. The resulting reduced expression can then be readily tested with a Truth Table, to verify that the reduction was valid. The rules of Boolean Algebra are:. AND Operations () 00 = 0 A0 = 0 10 = 0 A1 = A 01 = 0 AA = A 11 = 1 AA' = 0 OR Operations (+) 0+0 = 0 A+0 = A 1+0 = 1 A+1 = 1 0+1 = 1 A+A = A 1+1 = 1 A+A' = 1 NOT Operations (') 0' = 1 A'' = A 1' = 0 Associative Law (AB)C = A(BC) = ABC (A+B)+C = A+(B+C) = A+B+C Distributive Law A(B+C) = (AB) + (AC) A+(BC) = (A+B) (A+C) Commutative Law AB = BA A+B = B+A Precedence AB = AB AB+C = (AB) + C A+BC = A + (BC) DeMorgan's Theorem (AB)' = A' + B' (NAND) (A+B)' = A' B' (NOR)...
View Full
Document
 Winter '09

Click to edit the document details