Content deleted Content added
Started to add the pseudocode for the algorithm, still need to add the essential prime implicant pseudocode. |
|||
Line 194:
=== Finding the prime implicants ===
The pseudocode below recursively computes the prime implicants given the list of minterms of a boolean function. It does this by trying to merge all possible minterms and filtering out minterms that have been merged until no more merges of the minterms can be performed and hence, the prime implicants of the function have been found.
// Computes the prime implicants from a list of minterms.
// each minterm is of the form "1001", "1010", etc.
| |||