You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Added main functionality, which supports min and max terms. Maybe I'll
do the stuff on the TODO list at some point, depends on whether it
interests me or not.
This is a script that minimizes boolean algebra expressions using the minterms/maxterms (and any don't cares) of a given expression.
4
+
5
+
To run, install python 3.6 (may work on older version of 3.x, but untested), and run `python minimizer.py` in a console window.
6
+
7
+
Currently, the minimizer only supports minimization from minterms and maxterms, but I'd like to implement an expression parser that can parse and minimize, at the very least, expressions in sum of products form.
8
+
9
+
Other TODOs include getting minimal "hazard-free" implementations, mainly static hazards. Another thing that would be cool (but time consuming) would be to print K-maps for up to 6 variable instructions.
10
+
11
+
The algorithms used in this script are the [Quine-McCluskey algorithm](https://en.wikipedia.org/wiki/Quine%E2%80%93McCluskey_algorithm#Step_2:_prime_implicant_chart) to get essential prime implicants, and [Petrick's method](https://en.wikipedia.org/wiki/Petrick%27s_method) in order to find possible minimizations to cover the rest of the function.
0 commit comments