This project provides supporting files to analyse Boolean functions
The file "calculating_factors.py" calculates common and unique number of conjunctions in the truth table. The truth table is represented in Espresso form.
The file "transformation_to_RM.py" transforms the given truth table into positive polarity Reed-Muller forms. Both represented in Espresso form.