Skip to content

A Python-based Quine-McCluskey Algorithm adaptation.

License

Notifications You must be signed in to change notification settings

fh-logician/PyQM

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

19 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

PyQM

A Python project for simplifying logical expressions using the Quine-McCluskey Algorithm

How to Use

There are 2 different ways to get a simplified logical expression:

  • Minterm method
  • Maxterm method

Both methods will get you the same function but they differ by how they are connected together

  • NOT A OR NOT B (Minterm method) is the exact same as A AND B (Maxterm method)

Minterm Method

f = QM("ABC", [4, 5, 6, 7])
print(f.solve()) # --> A

g = QM("ABC", [3, 4, 5, 6, 7])
print(g.solve()) # --> A OR B AND C

Maxterm Method

f = QM("ABC", [0, 1, 2, 3], is_maxterm = True)
print(f.solve()) # --> NOT A

g = QM("ABC", [0, 1, 2], is_maxterm = True)
print(g.solve()) # --> (NOT A OR NOT B) AND (NOT A OR NOT C)

Using Don't Cares

f = QM("ABC", [0, 1], dont_cares = [4, 5, 6, 7])
print(f.solve()) # --> NOT B

g = QM("ABCD", [0, 2, 4, 8, 12], dont_cares = [6, 10, 11, 14, 15])
print(g.solve()) # --> NOT D

Feedback, Suggestions, Bugs

Any feedback, suggestions, or bugs can be submitted through the issues interface on here :)

About

A Python-based Quine-McCluskey Algorithm adaptation.

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages