【问题标题】:Boolean Expression with Laws带规律的布尔表达式
【发布时间】:2019-10-18 10:04:57
【问题描述】:

您好,有人可以帮帮我吗?这个布尔表达式是如何简化的?

abcd + d

简化为:

d

我试图使用我根本不懂的法律

这是法律

Basic Boolean Laws
Idempotent Law
    A * A = A
    A + A = A 
Associative Law
    (A * B) * C = A * (B * C)
    (A + B) + C = A + (B + C) 
Commutative Law
    A * B = B * A
    A + B = B + A 
Distributive Law
    A * (B + C) = A * B + A * C
    A + (B * C) = (A + B) * (A + C) 
Identity Law
    A * 0 = 0     A * 1 = A
    A + 1 = 1     A + 0 = A 
Complement Law
    A * ~A = 0
    A + ~A = 1 
Involution Law
    ~(~A) = A 
DeMorgan's Law
    ~(A * B) = ~A + ~B
    ~(A + B) = ~A * ~B 
Redundancy Laws
Absorption
    A + (A * B) = A
    A * (A + B) = A 

    (A * B) + (A * ~B) = A
    (A + B) * (A + ~B) = A 

    A + (~A * B) = A + B
    A * (~A + B) = A * B 

提前致谢!

【问题讨论】:

    标签: boolean-expression simplification


    【解决方案1】:

    确实是 D,如下:

    abcd+d -> (a+d)*(b+d)*(c+d)*(d+d) // Distributive Law  
    (a+d)*(b+d)*(c+d)*(d+d) -> (a+d)*(b+d)*(c+d)*d // Idempotent Law - d+d=d  
    (a+d)*(b+d)*(c+d)*d -> (a+d)*(b+d)*d  // Redundancy Laws - (c+d)*d = d  
    (a+d)*(b+d)*d -> (a+d)*d  // Redundancy Laws - (b+d)*d = d  
    (a+d)*d -> d  // Redundancy Laws - (a+d)*d = d  
    

    【讨论】:

      【解决方案2】:

      布尔表达式:abcd + d 可以简化为 -

      LHS = abcd + d    [Assume: abcd + d*1  as A * 1 = A ]
          = d(abc + 1)  [Distributive Law]
          = d(1 + abc)
          = d(1) [Identity Law (A + 1 = 1)]
          = d    [Identity Law (A * 1 = A)]
          = RHS
      

      【讨论】:

      • 您好!谢谢,但是您是如何使用分布式获得 1 的
      • 我已经应用了上述解决方案中定义的法律。
      • 我很困惑,它与使用分配的'ad + bd + cd + dd'相同吗?这样我就可以使用吸收定律来得到那个'd'
      • 这是我在 1 应用的定律: 1. A(B + C) = A.B + A.C (OR 分​​配定律) 2. A + (B.C) = (A + B).( A + C) (AND 分配律)
      猜你喜欢
      • 1970-01-01
      • 1970-01-01
      • 1970-01-01
      • 1970-01-01
      • 2010-09-21
      • 1970-01-01
      • 1970-01-01
      • 1970-01-01
      • 1970-01-01
      相关资源
      最近更新 更多