Skip to content
 
 

Latest commit

 

History

57 Commits

Folders and files

NameName
Last commit message
Last commit date
 
 
 
 
 
 
 
 

Repository files navigation

Quine-McCluskey algorithm

Python implementation of Quine–McCluskey algorithm to find:

  • The Prime Implicants
  • The Essential Prime Implicants
  • All minimum sum of products forms

Up to 26 variables

For any given function.

How to use

You can choose whether you want to run it interactively or not.

To use the interactive mode, you should run it normally with the following command: python main.py

For non-interactive use, you should run python main.py and specify the number of variables in the first argument, and then your minterms, and finally, the dont-cares which are optional.

For example: python main.py 4 0 1 2 3 4 -d 5 6 7 8 4 is the number of variables, the minterms are {0,1,2,3,4}, and the dont-cares are {5,6,7,8}.


Sample runs

python main.py:

python main.py 4 0 1 2 3 4 -d 8 9 10 11:

python main.py 3 0 4 2 6 7:

About

Using Quine–McCluskey algorithm to find PIs, EPIs and all minimum sum of products forms of a given K-Map function.

Resources

Stars

0 stars

Watchers

0 watching

Forks

Releases

Packages

Contributors

Languages