Truth Table to Boolean Expression

One truth table per line: "vars; rows that output 1" (A,B,C; 0,2,5,7) or "vars; output column" (A,B; 1100, the first character is the all-zero row)
Input mode:   Variables:   Dont cares:
Simplification:   Form:   Notation:
Verification:   Max rows:   Separator:
Calculation Result Download CSV
No. Form Expression Terms Verify

Introduction to the tool and how to use it

Enter a truth table and derive the simplest logic expression in reverse: you can list minterms as the variable list followed by row numbers whose output is 1 (such as A,B,C; 0,2,5,7), or write the output column directly (such as A,B; 1100).

This tool performs real minimization (Quine-McCluskey: prime implicants → essential terms plus Petrick minimum cover) and outputs three forms: canonical SOP Σm, minimal SOP, and minimal POS ΠM; notation can be symbolic (A'B + AC') or worded ((NOT A AND B) OR (A AND NOT C)).

Two notes: ① the first character of the output column corresponds to the all-zero row (row 0), then it rises in binary order; characters use 1 / 0 / x (don't-care, - also works), and length must equal 2 to the power of the number of variables; ② after checking don't-care, minterms merge further (rows in d(...) may freely take 0 or 1 as long as they do not conflict with minterms). Default is 3 variables, maximum 6; every row result is plugged back into the truth table and compared row by row, and Pass shows only when everything matches.

How to use

  1. Per the input mode, fill minterm row numbers or the output column on each line.
  2. Set the minimization method, expression form, and notation style.
  3. Click the Run button.
  4. Copy the canonical / minimal forms along with the back-substitution check result.

Message board

All messages →
0/200

  • No one has spoken up yet — want to go first?