Logic Gate Circuit Builder
Type a boolean expression and get its truth table, K-map and minimal SOP, derived step by step.
parsed as AB + BC + AC
PresetsUse + for OR, adjacency or · for AND, ' or ! for NOT
Truth table
| A | B | C | out |
|---|
Karnaugh map
| A\BC | 00 | 01 | 11 | 10 |
|---|---|---|---|---|
| 0 | 0 | 1 | 3 | 2 |
| 1 | 4 | 5 | 7 | 6 |
Evaluate AB + BC + AC for all 8 combinations of A, B, C.
step 1 of 17
Minimal SOP
…
- Minterms
- 0
- Prime implicants
- 0
- Terms in result
- 0
Prime implicants
Not computed yet.
Minimised with Quine-McCluskey, so the groups are exhaustive rather than eyeballed. Green cells are the squares the final cover accounts for.
← → to step, or use the buttons above.