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 get the minimized Boolean expression back. Write the rows that output 1 after a variable list (
This tool performs real minimization (Quine-McCluskey: prime implicants, then essential prime implicants with a Petrick minimum cover) and returns the canonical sum Σm, the minimal SOP and the minimal POS, in either symbol notation (
Two notes: (1) the first character of the output column is the all-zero row (row index 0), with later characters following binary order; use
A,B,C; 0,2,5,7), or simply type the output column (A,B; 1100).This tool performs real minimization (Quine-McCluskey: prime implicants, then essential prime implicants with a Petrick minimum cover) and returns the canonical sum Σm, the minimal SOP and the minimal POS, in either symbol notation (
A'B + AC') or word notation ((NOT A AND B) OR (A AND NOT C)).Two notes: (1) the first character of the output column is the all-zero row (row index 0), with later characters following binary order; use
1 / 0 / x (dont care, - also works) and keep the length equal to 2 to the power of the variable count. (2) Filling the dont-care box lets the minimizer merge further, since rows listed in d(...) may be taken as either 0 or 1 as long as they do not conflict with a minterm. Three variables by default, six at most, and every row of the result is substituted back into the truth table so a full match is reported as "Pass".
Message board
All messages →-
No one has spoken up yet — want to go first?