/McCluskey

Resolution of algorithm of Quine Mc Cluskey

Primary LanguageJavaGNU General Public License v3.0GPL-3.0

McCluskey

Resolve algorithm of Quine McCluskey. This is useful for simplify your boolean functions, like Karnaugh tables, with a better algorithm, which is used to reduce the cost of logical ports of your logical circuit.

Boolean values

a = a
¬a = A

Getting Started

Firstly you select how do you prefer to introuduce the main function.

MAXTERMS (option 1)

Example:

f(A,B,C) = (A + b)(a + B + c)

MINTERMS (option 2)

Example:

f(A, B, C) = Ab + aBc

INTRODUCE YOUR 'd' terms

After you introuduce your function, you can introduce some 'd' terms which will be used only if they were needed to simplify your logical results.

FINALLY

When execution is finisihed, it returns the solution of apply Quine McCluskey to your function.