Implementation of Quine McCluskey algorithm in Python 3
-
Updated
Mar 11, 2024 - Python
Implementation of Quine McCluskey algorithm in Python 3
A simple function to simplify boolean algebra expressions, inspired by Karnaugh Map.
Karnaugh Map Minimization 4 variables
This is a python code which solves the karnaugh map of 2 to 4 variables for you. It uses quine mccluskey algorithm to do so.
Generate Karnaugh maps fast with Python.
The Logic Gates generator is a command line program that makes use of Python to generate logic gate schematics of (theoretically) any size, along with their Karnaugh map.
Karnaugh map solver
Karnaugh-map for 2 , 3 and 4 variables in both sum of product and product of sum expressions, which takes min-terms or max-terms as input and return simplified expression with desired variables.
Boolean algebra simplifier based on n-dimensional k-maps
Boolean minimization using Karnaugh maps. Works for any number of bits >3.
The Quine-McCluskey algorithm is a method used for minimizing Boolean expressions.
This dataset imbalance visualization toolkit will be the beginning of a fire-new branch in NILM studies. (the website is pending)
Karnaugh simplify and other electronic related stuffs with GUI for ease of use
Add a description, image, and links to the karnaugh-map topic page so that developers can more easily learn about it.
To associate your repository with the karnaugh-map topic, visit your repo's landing page and select "manage topics."