Boolean Expression Simplifier
Enter a raw Boolean expression using standard notation and get the minimal SOP or POS form, the K-map it corresponds to, and an auto-generated circuit.
Why use this boolean expression simplifier
Standard notation supported
Use ' or ! for NOT, + for OR, and . or direct adjacency for AND, with full parentheses support.
Not just reformatted — actually minimized
The expression is evaluated into a truth table first, then minimized from scratch, so the result can be genuinely simpler than what you typed.
See it as a circuit too
The simplified expression is also rendered as a gate-level circuit diagram automatically.
Frequently asked questions
What notation does the expression parser accept?
Variable letters A-F, ' or a trailing apostrophe for NOT, + for OR, . or simple adjacency for AND, and parentheses for grouping — e.g. "A.B + A'.(C+D)".
Will it simplify an already-simple expression further?
Yes, if a simpler equivalent exists — the expression is converted to its full truth table first, so the result reflects the true minimal form, not just your original wording.
What happens if I enter an invalid expression?
The tool shows a parsing error with the position of the issue rather than guessing at what you meant.