How do you want to input your function?
The Boolean Bot can build truth tables, minimize logical expressions and simulate boolean functions. It uses the Quine-McCluskey algorithm and Petrick's method to find the optimal sum of products form of the function.
Enter the expression:
| Operators | ||||
|---|---|---|---|---|
| Grouping | Not | And | Xor | Or |
| (ab) | a' | ab | a^b | a+b |
Enter a comma separated list of min terms:
Enter a comma separated list of don't cares:
Tip: You can specify a range (e.g. 0, 2, 5-10, 13)
Enter a comma separated list of input variables:
Example: a, b, c, d