DIGITAL · TOOL

Minterm / Maxterm Expander

Expand a boolean expression into the canonical sum-of-minterms Σm and product-of-maxterms ΠM.

Advanced No backend · 100% client-side

What it does: Writes a boolean expression as the standard sum-of-minterms (Σm) and product-of-maxterms (ΠM).

When to use it: Canonicalizing, comparing Σm/ΠM indices, or preparing standard input for a Karnaugh map or simplification.

Expand into the canonical sum-of-minterms (Σm)? and product-of-maxterms (ΠM)? .

F =
→ Σm(1,2) / ΠM(0,3)
Next

You might also need

How to

How to use the minterm/maxterm expander

Write an expression → expand → read Σm and ΠM.

  1. 01

    Write a boolean expression

    Use single letters A–Z for variables. Operators AND OR NOT XOR or symbols & | ! ^, the trailing prime A', and concatenation AB are all supported.

  2. 02

    Click "Expand"

    The tool first builds the truth table, then lists the minterms where the output is 1 (forming Σm) and the maxterms where the output is 0 (forming ΠM).

  3. 03

    Read both canonical forms

    The top shows the index notation Σm(...) / ΠM(...), and below it the fully expanded expression. The two index sets are complementary.

Reference

Minterm vs maxterm

The two go in opposite directions and are easy to mix up — use this table to compare.

Minterm mᵢMaxterm Mᵢ
Taken fromRows where output = 1Rows where output = 0
Literal joiningAND (product term)OR (sum term)
Variable whose bit is 1True variable AComplemented variable A'
Variable whose bit is 0Complemented variable A'True variable A
FormsΣm sum-of-minterms (SOP)ΠM product-of-maxterms (POS)

Standard digital logic definitions (e.g. Mano, Digital Design).

FAQ

Common questions, answered in 3 minutes

What is the difference between a canonical form and a minimal form?

In the canonical form every term contains all variables and it is the unique standard expansion; the minimal form tries to reduce the number of terms and literals. To simplify, use the boolean algebra simplifier or the Karnaugh map tool.

Why are the Σm and ΠM indices complementary?

Each row's output is either 0 or 1: rows with output 1 go into Σm (minterms) and rows with output 0 go into ΠM (maxterms), together covering exactly the full set 0…2ⁿ-1.

How many variables are supported at most?

5, corresponding to up to 32 expansion terms, which keeps the result readable. With more variables the expansion gets very long, so simplify first.

What does the prime A' mean?

The prime denotes negation (NOT). A' means NOT A, matching the notation output by this tool and the simplifier, so you can paste between them directly.

How are always-true / always-false expressions shown?

An always-true expression (tautology) has no maxterms, so ΠM is empty and POS is written as 1; an always-false expression (contradiction) has no minterms, so Σm is empty and SOP is written as 0.

Data Provenance

Standards and sources referenced by this tool

Item Value / Formula Source
Minterm / Σm sum of minterms Digital logic canonical SOP
Maxterm / ΠM product of maxterms Digital logic canonical POS

Pure algorithmic computation, no external API.

⚡ Powered by Circflow