Minterms to Boolean Expression Solver
Enter a list of minterms and optional don't-cares, and get the minimal SOP or POS expression instantly, with the K-map and circuit generated automatically.
Why use this minterms to boolean expression solver
Fastest input for known minterms
If a problem is already given as Σm(...), skip re-deriving a truth table or clicking a map by hand.
Don't-cares in the same step
Enter don't-care minterms alongside the required ones in one form.
Matches textbook notation
Works directly from the same minterm-list notation used in most digital logic textbooks.
Frequently asked questions
What is a minterm?
A minterm is a single row of a truth table where the function equals 1 — numbered by treating its input combination as a binary number, e.g. minterm 5 for a 4-variable function is inputs 0101.
Can I enter minterms out of order?
Yes, order doesn't matter — "5,2,9" and "2,5,9" produce identical results.
What if I don't know the minterm numbers, only a description?
Use the Boolean Expression or Truth Table input modes instead — they update the same underlying data.