A Python-based Quine-McCluskey Algorithm adaptation.
-
Updated
Nov 12, 2020 - Python
A Python-based Quine-McCluskey Algorithm adaptation.
Minimization of boolean expressions is one of the fundamental aspects of Digital Design. This task was revolutionized by the QuineMccluskey technique. This repo contains C++ code used to minimize boolean functions through this technique. The implementation has been designed only for non Don't care type expressions.
CAD in NYCU
Project from course Data Structure and Algorithm
Implementación del método de Quine-McCluskey en JS
AGH University of science and technology - Python Labs - Project 1: Quine–McCluskey Algorithm
A NodeJS-based Quine-McCluskey Algorithm adaptation.
Computational Simulation of Quine-McCluskey Algorithm using C/C++
The Quine-McCluskey algorithm simplifies Boolean functions by grouping and combining minterms that differ by one bit until no further reductions are possible, resulting in a minimal expression.
This is a C++ implementation of Quine McClusky Method used to minimize a boolean function.
📲 Simplifies boolean expressions
Implementing Quine-McCluskey and Petrick methods to compute the minimization of a Boolean function
extension of quine-mccluskey minimization of logical expressions from boolean to multivalued
A JavaScript API to (visually) manage logical circuits
This is our report and code of 5SIB0 in TU/e, 2023. It is about validate QM algorithm by using Python.
Flask app that uses Quine-McCluskey/Petrick's algorithms to find least-cost boolean expressions
Egison Implementation of Quine-McCluskey method
Add a description, image, and links to the quine-mccluskey-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the quine-mccluskey-algorithm topic, visit your repo's landing page and select "manage topics."