Timeline for Disjunctive Normal Form
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 5, 2019 at 13:48 | vote | accept | lightsodium | ||
| May 5, 2019 at 13:30 | comment | added | RoyC | Yes you could, whichever you find easier. | |
| May 5, 2019 at 13:29 | comment | added | lightsodium | but i have not to simplify it to read out the DNF form? I could just work with the original equation? | |
| May 5, 2019 at 13:07 | history | edited | RoyC | CC BY-SA 4.0 |
added 187 characters in body
|
| May 5, 2019 at 13:01 | comment | added | RoyC | You can't you have to use the laws of boolean algebra to get to (bc' + bd'). After you put this in your truth table you can read out the DNF form. | |
| May 5, 2019 at 12:42 | comment | added | lightsodium | "that looks good your original equation reduces to (bc' + bd')": how can I read this just out of the truth table? and not by using laws to reduce the equation | |
| May 5, 2019 at 12:22 | comment | added | lightsodium | oh,thanks! so it still would be y= a'bc'd' + a'bc'd + a'bcd' + abc'd' + abc'd+abcd' | |
| May 5, 2019 at 12:19 | comment | added | RoyC | @lightsodium DNF requires all the variables to be present in all of the terms. | |
| May 5, 2019 at 12:17 | comment | added | lightsodium | the simplified boolean equation would be b(c'+d'), so i could simplify the DNF to y= bc'd' + bc'd + bcd' + bc'd' + bc'd+bcd' , right? | |
| May 5, 2019 at 12:15 | history | answered | RoyC | CC BY-SA 4.0 |