![](/img/trans.png)
[英]Converting logic gates to a purely NAND implementation, how come this is valid?
[英]How to write a logic expression with only NAND gates
我想將邏輯表達式轉換為僅具有NAND門。 我知道NAND寫為¬(A⋀B)
。
我有以下表達式 : (A⋁(¬B))⋀C
如何僅使用NAND編寫此表達式?
Y = (A ⋁ (¬B)) ⋀ C
= ¬¬{(A ⋁ (¬B)) ⋀ C} //Double negation
= ¬{¬(A V (¬B) V ¬C} //De-Morgan law
= ¬{(¬A ⋀ B) V ¬C} //Reverse De-Morgan law
= ¬{(¬A V ¬C) ⋀ (B V ¬C)} //Distributive law
= ¬{¬(A ⋀ C) ⋀ ¬(¬B ⋀ C)} //Apply reverse De-Morgan law
聲明:本站的技術帖子網頁,遵循CC BY-SA 4.0協議,如果您需要轉載,請注明本站網址或者原文地址。任何問題請咨詢:yoyou2525@163.com.