A robust, insanely fast and stupidly easy to use CLI tool for minimizing circuits via the Quine Mccluskey method.
-
Updated
Nov 24, 2023 - Python
A robust, insanely fast and stupidly easy to use CLI tool for minimizing circuits via the Quine Mccluskey method.
Implementation of Quine McCluskey algorithm in Python 3
Boolean expression simplifier/minimizer
32bit Simplifier of Boolean functions
Generator for wokwi schematics that implement lookup tables in conjunctive normal form (CNF), i.e. with AND and OR gates
Flask app that uses Quine-McCluskey/Petrick's algorithms to find least-cost boolean expressions
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.
Project from course Data Structure and Algorithm
Implementation of Quine-McCluskey algorithm
Implementación del método de Quine-McCluskey en JS
📲 Simplifies boolean expressions
💡 The Quine-McCluskey algorithm implemented in C# 7 (.NET Core)
Logical expression simplifier written in Python. It uses the Quine–McCluskey algorithm.
Logic Network Synthesizer based on Quine–McCluskey algorithm
A Python-based Quine-McCluskey Algorithm adaptation.
This is an Android Application project using Java. Quine-McCluskey Tabulation was implemented by the project.
CAD in NYCU
Egison Implementation of Quine-McCluskey method
Simple implementation of Quine-McCluskey algorithm in C language.
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."