Truth Table Generator
Type a Boolean expression and get a full truth table instantly — including minterm lists. Free, no signup; computation runs locally in your browser.
From table to gates
After you build a table, draw the circuit on the logic gate maker.
A truth table lists every input combination and the output of a Boolean function. Students use them to check homework; engineers use them to verify combinational logic before drawing gates. This generator evaluates your expression for each row (up to six variables) with no account and no server-side solver fee.
How to generate a truth table
Enter the expression
Use single-letter variables. NOT as A' or NOT A; AND by juxtaposition (AB) or *; OR as +.
Generate
Every input assignment is evaluated locally. Rows where F=1 are collected as minterms Σm(…).
Simplify next
Copy the minterms into the Karnaugh map solver for a minimal SOP/POS, or open the logic gate maker to draw the circuit.
Truth tables in digital logic
For n inputs there are 2^n rows. Each row is a minterm (when F=1) or maxterm (when F=0). Sum-of-products writes F as the OR of minterms; product-of-sums writes F as the AND of maxterms.
Notation here follows common homework style: A' for NOT A, AB for A AND B, A+B for A OR B, and XOR as a keyword or ^. Parentheses control precedence.
After you trust the table, minimize with a Karnaugh map or Quine-McCluskey (this site K-map solver uses Quine-McCluskey under the hood) and implement with gates.
Frequently asked questions
Is this truth table generator free?
Yes. It runs in your browser with no signup. Diagram generation elsewhere on the site uses hourly fair-use limits.
How many variables are supported?
Up to six (64 rows), which covers typical homework. Larger functions should be split or scripted offline.
Does it support don’t-cares?
The truth table shows 0/1 from an expression. For don’t-cares, use the Karnaugh map solver’s minterm + X inputs.
Can I draw gates from the table?
Yes. Take the expression or minterms to the Boolean-to-logic-circuit or logic gate maker pages.
Boolean and logic tools
K-map solver, Boolean-to-circuit, and logic gate maker.
Karnaugh Map Solver
Simplify Boolean functions with a real minimizer — minimal SOP and POS, optional don’t-cares, and a K-map grid for 2–4 variables. Runs in your browser; free, no signup.
Boolean Expression to Logic Circuit
Paste a Boolean expression from your homework and get a clean logic gate diagram: AND, OR, NOT, NAND, NOR, and XOR, with labeled inputs and outputs.
Free AI Logic Gate Diagram Maker
Describe any Boolean logic circuit and FreeDiagram draws the gate diagram instantly — gates, inputs, outputs, and signal flow. Free, hourly fair-use limited, no signup.
Flowchart Symbols and Meanings
A clear chart of the standard flowchart shapes and what each one means, plus free examples you can open and edit. No signup; hourly fair-use limits apply when you generate.