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
Create minimum MCDC test sets for a boolean expression
32bit Simplifier of Boolean functions
DenseQMC: A bit-slice implementation of the Quine-McCluskey algorithm
A Quine McCluskey solver for minimization of boolean functions
A powerful tool for minimizing Boolean functions
C Program for implementation of tabulation method
Logic Network Synthesizer based on Quine–McCluskey algorithm
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
A C/C++ implementation of the Quine–McCluskey algorithm.
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
Illustrate Quine–McCluskey algorithm in PHP
C# implementation of the Quine-McCluskey algorithm and Petrick's method
Boolean function minimizer based on Quine–McCluskey algorithm.
C++ implementation of Quine-McCluskey and Petrick's method to simplify boolean expressions
CLI tool that minimizes Boolean functions using the Quine–McCluskey algorithm. Outputs a minimal sum-of-products expression. C#/.NET.
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."