Search for a tool
Boolean Minterms and Maxterms

Tool for calculating Minterms (canonical disjunctive normal form) and Maxterms (canonical conjunctive normal form) from a truth table of a unknown Boolean expression.

Results

Boolean Minterms and Maxterms -

Tag(s) : Symbolic Computation, Electronics

Share
Share
dCode and more

dCode is free and its tools are a valuable help in games, maths, geocaching, puzzles and problems to solve every day!
A suggestion ? a feedback ? a bug ? an idea ? Write to dCode!


Please, check our dCode Discord community for help requests!
NB: for encrypted messages, test our automatic cipher identifier!


Feedback and suggestions are welcome so that dCode offers the best 'Boolean Minterms and Maxterms' tool for free! Thank you!

Boolean Minterms and Maxterms

Maxterms/Minterms Calculator





From the Truth Table







From the Boolean expression




Answers to Questions (FAQ)

What is a Boolean minterm? (Definition)

A minterm is an expression regrouping the Boolean variables, complemented or not (a or not(a)), linked by logical ANDs and with a value of 1. The minterm is described as a sum of products (SOP).

Example: a OR b OR !c = 1 or (a AND NOT(b)) OR (NOT(c) AND d) = 1 are minterms

Each row of a logical truth table with value 1/True can therefore be associated to exactly one minterm.

A Boolean expression expressed as a sum of products (SOP) is also described as a disjunctive normal form (DNF).

What is a Boolean maxterm? (Definition)

A maxterm is an expression grouping Boolean variables, complemented or not (a or not (a)), linked by logical ORs and with a value of 0. The maxterm is described as a sum of product (SOP).

Example: a AND b AND c = 0 or (NOT(a) OR b) AND (NOT(c) OR d) = 0 are maxterms

Each row of a logical truth table worth 0/False can therefore be associated to exactly one maxterm.

A Boolean expression expressed as a product of sums (POS) is also described as conjunctive normal form (CNF).

How to calculate minterms and maxterms from the truth table?

The minterms are the Boolean expressions corresponding to the true/1 rows and the maxterms are those of the false/0 rows.

Example: The function F has for logical truth table

abF
000
010
101
111

On dCode, indicate the Boolean output values of the logical expression, ie. the sequence of 0 and 1 representing the last column of the Boolean truth table. dCode will compute compatible sets of variables and simplify the result.

Example: Enter 0011 (from 00 to 11) as the output values of the F Truth Table to obtain for simplified canonical form minterm/maxterm a (identical in this case)

How to calculate a minterm from a truth table?

The minterms of a boolean function are the aggregates of each row true of the truth table linked with logical OR.

Example: The minterms are the rows with value 1 being the rows 3 (a*!b=1) and 4 (a*b=1) so the minterms of F are the function (a*!b)+(a*b) which after boolean simplification gives a

How to calculate a maxterm from a truth table?

The maxterms of a function are the aggregates of each maxterm of the logical array with logical ANDs.

The maxterms are the rows with value 0 being the rows 1 (a+b=0) and 2 (a+!b=0) thus the maxterms of F are the function (a+b)*(a+!b) which after boolean simplification is worth a.

What is the difference between minterm and maxterm?

A maxterm is an expression grouping Boolean variables, complemented or not (a or not (a)), linked by logical ORs and with a value of 0.

Example: a OR b OR c = 0 or a OR NOT(b) OR NOT(c) OR d = 0 are maxterms

Each row of a logical truth table worth 0/False can therefore be associated to exactly one maxterm.

The minterms and maxterms are two ways to see the same logical Boolean expression either with its 0 or with its 1 logic.

Source code

dCode retains ownership of the "Boolean Minterms and Maxterms" source code. Any algorithm for the "Boolean Minterms and Maxterms" algorithm, applet or snippet or script (converter, solver, encryption / decryption, encoding / decoding, ciphering / deciphering, breaker, translator), or any "Boolean Minterms and Maxterms" functions (calculate, convert, solve, decrypt / encrypt, decipher / cipher, decode / encode, translate) written in any informatic language (Python, Java, PHP, C#, Javascript, Matlab, etc.) or any database download or API access for "Boolean Minterms and Maxterms" or any other element are not public (except explicit open source licence like Creative Commons). Same with the download for offline use on PC, mobile, tablet, iPhone or Android app.
Reminder: dCode is an educational and teaching resource, accessible online for free and for everyone.

Cite dCode

The content of the page "Boolean Minterms and Maxterms" and its results may be freely copied and reused, including for commercial purposes, provided that dCode.fr is cited as the source. Exporting the results is free and can be done simply by clicking on the export icons ⤓ (.csv or .txt format) or ⧉ (copy and paste).
To cite dCode.fr on another website, use the link: https://www.dcode.fr/minterms-maxterms-calculator
In a scientific article or book, the recommended bibliographic citation is: Boolean Minterms and Maxterms on dCode.fr [online website], retrieved on 2025-04-15, https://www.dcode.fr/minterms-maxterms-calculator

Need Help ?

Please, check our dCode Discord community for help requests!
NB: for encrypted messages, test our automatic cipher identifier!

Questions / Comments

Feedback and suggestions are welcome so that dCode offers the best 'Boolean Minterms and Maxterms' tool for free! Thank you!


https://www.dcode.fr/minterms-maxterms-calculator
© 2025 dCode — The ultimate collection of tools for games, math, and puzzles.
 
Feedback