For a boolean function of n variables , a product term in which each of the n variables appears once (in either its complemented or uncomplemented form) is called a minterm. Thus, a minterm is a logical expression of n variables that employs only the complement operator and the conjunction operator.

For example, abc, ab'c and abc' are 3 examples of the 8 minterms for a Boolean function of the three variables a, b and c. The customary reading of the last of those is a AND b AND NOT-c.

There are 2n minterms of n variables, since a variable in the minterm expression can be in either its direct or its complemented form--two choices per n variables.

según wikipedia:

For a boolean function of n variables , a product term in which each of the n variables appears once (in either its complemented or uncomplemented form) is called a minterm. Thus, a minterm is a logical epresionje of n variables that employs only the complement operator and the conjunction operator.

For example, abc, ab'c and abc' are 3 examples of the 8 minterms for a Boolean function of the three variables a, b and c. The customary reading of the last of those is a AND b AND NOT-c.

There are 2n minterms of n variables, since a variable in the minterm epresionje can be in either its direct or its complemented form--two choices per n variables.

En cuanto a ello...

Minimizar una función:

Expresar una función con la menor cantidad de términos y variables posibles.

Ten en cuenta, que NOR y XOR son compuertas hechas con funciones AND y OR, y si mal no recuerdo, las anteriores son más lentas.

ĀB+CA

(A+B)(C+B)

Por las variables que expresaste... no son minterms ni maxterms... son SP y PS

SP:Suma de productos ^ PS:Producto de sumas != Minterm ^ Maxterms.