ORIGINAL FUNCTION
BOOLEAN ALGEBRA, VISUALIZED
Enter a Boolean function your way. Get a minimized expression, truth table, gate implementations, and a proof that every circuit agrees.
Use comma-separated decimal row indexes. Variables are A, B, C… (A is most significant). Don't-care indexes are optional and shared between Σm/ΠM.
Operators: ' or ! NOT · * or adjacency AND · + or | OR · parentheses supported. Variable order controls column order in the truth table, SOP/POS, and diagrams.
Click each output to cycle through 0, 1, and X (don't care).
00 minterms · 0 don't caresClick a cell to cycle 0, 1, and X (don't care) — the small number in each cell's corner is its minterm/row index.
ORIGINAL FUNCTION
MINIMIZED SOP
COMPLEMENT / POS FORM
CIRCUIT LEGEND
Each diagram is generated from the minimized function and uses only the gate family named on its card.