A project to simulate QuineMcClusky process to do the following: 1- Generate and print all prime implicants using the Quine-McCluskey tabulation method. 2-obtain and print all the essential prime implicants. 3-Obtain the subset of the non-essential prime implicants needed to complete the solution.

Implements cubes, covers, and their associated logic operations

What can be better than a cup of coffee during a break? A coffee that you don’t have to make yourself. It’s enough to press a couple of buttons on the machine and you get a cup of energy; but first, we should teach the machine how to do it. In this project, you will work on programming a coffee machine simulator. The machine works with typical p…

A-Level Computing Project (LogicSim)

Experiments fooling around with relational interpretation - run a subset of clojure backwards

Assignment in Programming Languages Course

build and show a truth table from a boolean expression

Educational tool for building boolean logic circuits

A boolean function parser and interpreter.

Boolean algebra simplifier based on n-dimensional k-maps

Kori - Algorithm with kotlin - AlKorithm

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 logic, boolean-expression, boolean-algebra, boolean

Minimize Boolean functions using Quine-McCluskey and Petrick's algorithm.

Boolean DSL

DFS-based algorithm to check whether boolean function is monotone or not

Develop a computer from ground up. From NAND to Tetris!

📟 A BCD to seven segment display decoder implementation

Material from the course of Design of Digital Systems at ENSEM - Université de Lorraine.