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 (·) 0·0 = 0 A·0 = 0 1·0 = 0 A·1 = A 0·1 = 0 A·A = A 1·1 = 1 A·A' = 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 (A·B)·C = A·(B·C) = A·B·C (A+B)+C = A+(B+C) = A+B+C Distributive Law A·(B+C) = (A·B) + (A·C) A+(B·C) = (A+B) · (A+C) Commutative Law A·B = B·A A+B = B+A Precedence AB = A·B A·B+C = (A·B) + C A+B·C = A + (B·C) DeMorgan's Theorem (A·B)' = A' + B' (NAND) (A+B)' = A' · B' (NOR)...
View Full Document
This document was uploaded on 02/06/2012.
- Winter '09