A Python implementation of the Quine–McCluskey algorithm for Boolean function minimization. Includes a theoretical report, interactive Jupyter notebook, and truth table verification.
-
Updated
Jul 3, 2025 - Jupyter Notebook
A Python implementation of the Quine–McCluskey algorithm for Boolean function minimization. Includes a theoretical report, interactive Jupyter notebook, and truth table verification.
Material from the course of Design of Digital Systems at ENSEM - Université de Lorraine.
Add a description, image, and links to the combinatorial-logic topic page so that developers can more easily learn about it.
To associate your repository with the combinatorial-logic topic, visit your repo's landing page and select "manage topics."