Boolean Algebra Simplifier
Simplify Boolean expressions using algebraic laws, Quine-McCluskey, and Karnaugh map minimization. Enter any logic expression (AND, OR, NOT, XOR, NAND, NOR) and instantly get the minimal SOP/POS form, full truth table, K-map visualization, gate diagram, step-by-step law applications, and NAND/NOR-only equivalents.
Your ad blocker is preventing us from showing ads
MiniWebtool is free because of ads. If this tool helped you, please support us by going Premium (ad‑free + faster tools), or allowlist MiniWebtool.com and reload.
- Allow ads for MiniWebtool.com, then reload
- Or upgrade to Premium (ad‑free)
About Boolean Algebra Simplifier
The Boolean Algebra Simplifier reduces any logic expression to its minimal form using the Quine-McCluskey algorithm and Karnaugh map analysis. Enter expressions with AND, OR, NOT, XOR, NAND, NOR (or symbols like &, |, ~, ^, postfix A'), and instantly receive the full truth table, a colored K-map with prime implicant loops, a prime implicant chart marking essentials, a step-by-step derivation, and equivalent NAND-only and NOR-only implementations.
What the Simplifier Produces
Boolean Algebra Laws — Reference
| Law | OR form | AND form |
|---|---|---|
| Identity | \( A + 0 = A \) | \( A \cdot 1 = A \) |
| Null | \( A + 1 = 1 \) | \( A \cdot 0 = 0 \) |
| Idempotent | \( A + A = A \) | \( A \cdot A = A \) |
| Complement | \( A + \overline{A} = 1 \) | \( A \cdot \overline{A} = 0 \) |
| Double Negation | \( \overline{\overline{A}} = A \) | |
| Commutative | \( A + B = B + A \) | \( A \cdot B = B \cdot A \) |
| Associative | \( (A + B) + C = A + (B + C) \) | \( (A \cdot B) \cdot C = A \cdot (B \cdot C) \) |
| Distributive | \( A \cdot (B + C) = AB + AC \) | \( A + BC = (A+B)(A+C) \) |
| Absorption | \( A + AB = A \) | \( A(A + B) = A \) |
| De Morgan's | \( \overline{A + B} = \overline{A} \cdot \overline{B} \) | \( \overline{A \cdot B} = \overline{A} + \overline{B} \) |
| Consensus | \( AB + \overline{A}C + BC = AB + \overline{A}C \) | |
Input Syntax Cheat Sheet
| Operator | Accepted Forms | Example |
|---|---|---|
| AND | &, *, ·, ., concatenation AB, word AND, ∧ | A&B, AB, A AND B |
| OR | +, |, word OR, ∨ | A+B, A | B, A OR B |
| NOT | ~, !, ¬, word NOT, postfix ' | ~A, !A, A', (AB)' |
| XOR | ^, ⊕, word XOR | A XOR B, A^B |
| NAND | ⊼, word NAND | A NAND B |
| NOR | ⊽, word NOR | A NOR B |
| Implies | ->, =>, word IMPLIES, → | A -> B |
| Equivalence | <->, <=>, word IFF, ↔ | A <-> B |
| Constants | 0 1 TRUE FALSE | A + 0, A * 1 |
The Quine-McCluskey Algorithm
The Quine-McCluskey method is a systematic, tabular approach to finding the minimal Sum-of-Products expression. Unlike the Karnaugh map (which is visual and limited to about 6 variables), Quine-McCluskey scales and always produces a guaranteed-minimal cover.
- List all minterms — each row of the truth table that evaluates to 1.
- Group by one-bit count — sort minterms by the number of 1s in their binary representation.
- Combine adjacent groups — pairs that differ by exactly one bit merge, replacing that bit with a dash. Repeat until no more combinations are possible.
- Collect prime implicants — any term that was never combined further is a prime implicant.
- Build the prime-implicant chart — a grid with primes as rows and minterms as columns. Mark which primes cover which minterms.
- Select essential primes — any prime that is the only one covering some minterm is essential.
- Cover the remaining minterms — choose additional primes to cover minterms not yet covered by essentials, minimizing literal count.
How to Use the Boolean Algebra Simplifier
- Enter the expression: Type any Boolean expression using the notation you prefer. You can mix styles —
A.B + A'CandA AND B OR NOT A AND Cparse identically. - Click Simplify: The tool parses, builds the truth table, runs Quine-McCluskey, and minimizes the expression.
- Study the K-map: Each colored loop is a prime implicant. Essential primes are drawn with solid lines, non-essentials with dashes.
- Review the steps: The step-by-step panel walks from canonical SOP through prime implicant discovery to the minimal form.
- Inspect equivalent forms: Use the minimal POS when your target technology is OR-of-AND, or the NAND-only form when targeting NAND-based silicon.
Applications
| Field | Use Case |
|---|---|
| Digital Circuit Design | Minimize gate count in combinational logic — fewer gates means lower power, smaller die, shorter propagation delay. |
| Compiler Optimization | Simplify conditional expressions in if-statements and loop guards to reduce branch evaluation cost. |
| Programmable Logic (FPGA) | Fit more logic into available look-up tables by producing minimal-literal forms. |
| Database Query Optimization | Rewrite WHERE-clause predicates into equivalent but cheaper-to-evaluate forms. |
| Formal Verification | Canonical forms (SOP/POS) enable equivalence checking of two specifications. |
| Teaching / Coursework | Verify homework, study prime implicant selection, explore K-map grouping strategies. |
FAQ
&, *, ·, ., or simple concatenation (AB means A AND B). OR can be + or |. NOT can be ~, !, ¬, or a postfix apostrophe (A', (A+B)'). Word operators AND OR NOT XOR NAND NOR IMPLIES IFF also work, as do arrow forms -> and <->. Parentheses group sub-expressions. Constants 0 and 1 (or TRUE/FALSE) represent fixed values.Reference this content, page, or tool as:
"Boolean Algebra Simplifier" at https://MiniWebtool.com/boolean-algebra-simplifier/ from MiniWebtool, https://MiniWebtool.com/
by miniwebtool team. Updated: 2026-04-19
You can also try our AI Math Solver GPT to solve your math problems through natural language question and answer.
Related MiniWebtools:
Advanced Math Operations:
- Antilog Calculator
- Beta Function Calculator
- Binomial Coefficient Calculator
- Binomial Probability Distribution Calculator
- Bitwise Calculator Featured
- Central Limit Theorem Calculator
- Combination Calculator
- Complementary Error Function Calculator
- Complex Number Calculator
- Entropy Calculator
- Error Function Calculator
- Exponential Decay Calculator Featured
- Exponential Growth Calculator
- Exponential Integral Calculator
- Exponents Calculator
- Factorial Calculator
- Gamma Function Calculator
- Golden Ratio Calculator
- Half Life Calculator
- Percent Growth Rate Calculator Featured
- Permutation Calculator
- Poisson Distribution Calculator
- Polynomial Roots Calculator
- Probability Calculator
- Probability Distribution Calculator
- Proportion Calculator
- Quadratic Formula Calculator
- Scientific Calculator
- Scientific Notation Calculator
- Significant Figures Calculator New
- Sum of Cubes Calculator
- Sum of Positive Integers Calculator Featured
- Sum of Squares Calculator
- Truth Table Generator New
- Set Theory Calculator New
- Venn Diagram Generator (3 Sets) New
- Chinese Remainder Theorem Calculator New
- Euler's Totient Function Calculator New
- Extended Euclidean Algorithm Calculator New
- Modular Multiplicative Inverse Calculator New
- Continued Fraction Calculator New
- Dijkstra's Shortest Path Calculator New
- Minimum Spanning Tree Calculator New
- Graph Degree Sequence Validator New
- Derangement (Subfactorial) Calculator New
- Stirling Numbers Calculator New
- Pigeonhole Principle Calculator New
- Markov Chain Steady State Calculator New
- Rounding Calculator New
- Negative Binomial Distribution Calculator New
- Permutations with Repetition Calculator New
- Modular Exponentiation Calculator New
- Primitive Root Calculator New
- Boolean Algebra Simplifier New