Implementation of Quine McCluskey algorithm in Python 3
-
Updated
Mar 11, 2024 - Python
Implementation of Quine McCluskey algorithm in Python 3
Karnaugh map simplification software, used to visually simplify boolean expressions
32bit Simplifier of Boolean functions
DenseQMC: A bit-slice implementation of the Quine-McCluskey algorithm
Logic Network Synthesizer based on Quine–McCluskey algorithm
A powerful tool for minimizing Boolean functions
C Program for implementation of tabulation method
A Quine McCluskey solver for minimization of boolean functions
Generator for wokwi schematics that implement lookup tables in conjunctive normal form (CNF), i.e. with AND and OR gates
💡 The Quine-McCluskey algorithm implemented in C# 7 (.NET Core)
use method of Quine-McCluskey to find essential prime
Illustrate Quine–McCluskey algorithm in PHP
C# implementation of the Quine-McCluskey algorithm and Petrick's method
Repairing Boolean logical models from time-series data using Answer Set Programming
Quine-McCluskey
A C/C implementation of the Quine–McCluskey algorithm.
A hardware-based teaching aid for students to get familiarized with sequential logic using Basys FPGA boards.
Takes in either a boolean algebraic expression, a sum of minterms expression or a product of maxterms expression and produces the simplest SOP, POS and truth tables and, optionally, the K-Map using Quine-McCluskey
Add a description, image, and links to the quine-mccluskey topic page so that developers can more easily learn about it.
To associate your repository with the quine-mccluskey topic, visit your repo's landing page and select "manage topics."