Tool for calculating Minterms (canonical disjunctive normal form) and Maxterms (canonical conjunctive normal form) from a truth table of a unknown Boolean expression.
Boolean Minterms and Maxterms - dCode
Tag(s) : Symbolic Computation, Electronics
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!
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).
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).
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
a | b | F |
---|---|---|
0 | 0 | 0 |
0 | 1 | 0 |
1 | 0 | 1 |
1 | 1 | 1 |
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)
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
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.
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.
dCode retains ownership of the "Boolean Minterms and Maxterms" source code. Except explicit open source licence (indicated Creative Commons / free), the "Boolean Minterms and Maxterms" algorithm, the applet or snippet (converter, solver, encryption / decryption, encoding / decoding, ciphering / deciphering, breaker, translator), or the "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.) and all data download, script, or API access for "Boolean Minterms and Maxterms" are not public, same for offline use on PC, mobile, tablet, iPhone or Android app!
Reminder : dCode is free to use.
The copy-paste of the page "Boolean Minterms and Maxterms" or any of its results, is allowed (even for commercial purposes) as long as you credit dCode!
Exporting results as a .csv or .txt file is free by clicking on the export icon
Cite as source (bibliography):
Boolean Minterms and Maxterms on dCode.fr [online website], retrieved on 2024-11-21,