De Morgan's laws

From testwiki
Revision as of 11:21, 12 December 2019 by imported>Ans (Ans moved page DeMorgan's Laws to De Morgan's laws)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

De_Morgan's laws (or De_Morgan's theorems) are used to simplify the Boolean expressions.

There are two theorems:

  1. The complement of two or more AND variables is equal to the OR of the complements of each variable.
    xy=x¯+y¯
  2. The complement of two or more OR variables is equal to the AND of the complements of each variable.
    x+y=x¯y¯

Note that this theorems are true in both direction

Examples

  • xyz=x¯+y¯+z¯
  • x+y+z=x¯y¯z¯
  • Note that x can be a combination of other variables.

lets say x=(A+B) and y=(C+D) so:

xy=x¯+y¯

will be:

(A+B)(C+D)=(A+B)+(C+D)=A¯B¯+C¯D¯
  • In case we have more than one livile bar (or complement or negate) start with the top bar first
(A+B)+(C+D)=(A+B).(C+D)=(A+B)(C+D)

Note that A=A Boolean rule.

  • ABC+D+E=ABCD¯E¯=ABCD¯E¯
  • (A+B)C¯+D+E¯=((A+B)C¯)D¯E=((A+B)+C)D¯E=(A¯B¯+C)D¯E