Search for a tool
Boolean Minterms and Maxterms

Tool for calculating Minterms and Maxterms from a Boolean expression (Boole Algebra) with AND and OR operators.

Results

Boolean Minterms and Maxterms -

Tag(s) : Symbolic Computation, Electronics

Share dCode and you

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!

Team dCode likes feedback and relevant comments; to get an answer give an email (not published). It is thanks to you that dCode has the best Boolean Minterms and Maxterms tool. Thank you.

# Boolean Minterms and Maxterms

## Maxterms/Minterms Calculator

 Boolean Table From 0,...,0 to 1,...,1 From 1,...,1 to 0,...,0
 Notation Logical (&&, ||, !) Algebraic (*, +, !) Literal (AND, OR, NOT)

### Maxterms Calculator

Tool for calculating Minterms and Maxterms from a Boolean expression (Boole Algebra) with AND and OR operators.

### 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.

Example: a AND b AND c = 1 or NOT(a) AND b AND NOT(c) AND d = 1

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

### 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.

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

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

### How to calculate a minterm or a maxterm from a truth table?

The minterms of a boolean function are the aggregates of each minterm of the logical array with logical OR.

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

Example: The function F has truth table

abF
000
010
101
111

Example: The minterms are the lines with value 1 being the lines 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 are the lines with value 0 being the lines 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.

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 minterm a and maxterm a

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 source code of the script Boolean Minterms and Maxterms online. Except explicit open source licence (indicated Creative Commons / free), any algorithm, applet, snippet, software (converter, solver, encryption / decryption, encoding / decoding, ciphering / deciphering, translator), or any function (convert, solve, decrypt, encrypt, decipher, cipher, decode, code, translate) written in any informatic langauge (PHP, Java, C#, Python, Javascript, Matlab, etc.) which dCode owns rights will not be released for free. To download the online Boolean Minterms and Maxterms script for offline use on PC, iPhone or Android, ask for price quote on contact page !