📖 How to Use
🎯 Two Ways to Input
Option 1 - Type Expression: Enter a Boolean expression in the input field (e.g., AB + BC) and click "Load Expression to Table" to populate the truth table automatically.
Option 2 - Click Truth Table: Click the output cells in the truth table to set them to 1 (true), 0 (false), or X (don't care). The current expression updates in real-time.
📝 Expression Notation
- NOT: Use apostrophe
A'or exclamation!A - AND: Use space
AB, dotA·B, or asteriskA*B - OR: Use plus sign
A + B - Example:
A'B'C + A'BC + AB'C + ABC - Partial terms: Terms like
BCautomatically expand to all matching minterms
⚙️ Output Forms
- SOP (Sum of Products): OR of AND terms →
AB + BC + AC - POS (Product of Sums): AND of OR terms →
(A+B)(B+C)(A+C)
🔬 Quine-McCluskey Algorithm
This tool uses the Quine-McCluskey algorithm, the gold standard for programmatic Boolean simplification. It systematically finds the minimal expression by:
- Grouping minterms by number of 1s
- Combining terms that differ by one bit
- Identifying prime implicants
- Selecting the minimum essential set
📝 Boolean Expression
Operators: ' (NOT), · or space (AND), + (OR) | Variables: A-Z (case insensitive)
Quick Examples:
📊 Truth Table
Current Expression from Table:
-
Allow unspecified outputs for better optimization - click outputs to cycle: 0 → 1 → X
⚙️ Output Settings
SOP: OR of ANDs, POS: AND of ORs