A lightweight Python desktop application for generating truth tables and minimizing Boolean functions using the Quine-McCluskey algorithm. The tool visualizes Karnaugh Maps (K-Maps) and identifies optimal groupings.

Functions and modules to help with problems relating to boolean algebra and digital circuit design. Requires 0 external libraries or packages.

Quine-McCluskey Minimization Technique (Tabular-Method) Digital Logic Design

A boolean algebra toolkit written in python

A powerful tool for minimizing Boolean functions

Implementation of Quine McCluskey algorithm in Python 3

Generator for wokwi schematics that implement lookup tables in conjunctive normal form (CNF), i.e. with AND and OR gates

The Quine-McCluskey algorithm is a method used to simplify boolean expressions. This is an implementation of the algorithm using Python.

A complete code of Quine mccluskey and patrick’s method with each steps

Karnaugh map solver

Flask app that uses Quine-McCluskey/Petrick's algorithms to find least-cost boolean expressions

A Python-based Boolean Expression evaluator and simplifier.

AGH University of science and technology - Python Labs - Project 1: Quine–McCluskey Algorithm