Visualizations of circuits made possible by Lelleck.
Can solve any boolean expression and create CCNF(POS), CDNF(SOP) and minimize it using the Quine-McCluskey Method.
Minimization for expressions with 7 variables and beyond may take some time (and memory), since it has exponential complexity.
Also converts boolean expressions to only use NAND or NOR gates and can draw them.
Example:
NAND/NOR conversion
Gate with NAND
Gate with NOR
-
Notifications
You must be signed in to change notification settings - Fork 2
Solves boolean expressions and simplifies them, draws logic-circuits and constructs circuits and boolean terms from truth-table values and converts boolean expressions to NAND and NOR.
License
MaxWolf-01/TruthTabler
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Solves boolean expressions and simplifies them, draws logic-circuits and constructs circuits and boolean terms from truth-table values and converts boolean expressions to NAND and NOR.
Topics
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published