Home
Online minimization of boolean functions
Online minimization of boolean functions
Input equation = ~abc+a~bc+ab~c+abc
Truth table
| a | b | c | Output |
| 0 |
0 |
0 |
0 |
| 0 |
0 |
1 |
0 |
| 0 |
1 |
0 |
0 |
| 0 |
1 |
1 |
1 |
| 1 |
0 |
0 |
0 |
| 1 |
0 |
1 |
1 |
| 1 |
1 |
0 |
1 |
| 1 |
1 |
1 |
1 |
DNF (with ~) = ~abc + a~bc + ab~c + abc
DNF (with overline) = abc + abc + abc + abc
CNF (with ~) = (a + b + c) (a + b + ~c) (a + ~b + c) (~a + b + c)
CNF (with overline) = (a + b + c) (a + b + c) (a + b + c) (a + b + c)
Minimal Form (with ~) = bc + ac + ab
Minimal Form (with overline) = bc + ac + ab
Karnaugh map
| c |
c |
| ab |
0 |
0 |
| ab |
0 |
1 |
| ab |
1 |
1 |
| ab |
0 |
1 |