Quine–McCluskey algorithm: Difference between revisions

Content deleted Content added
m Add missing letter in algorithm pseudocode
m Fix bugs in pseudocode implementation
Line 281:
'''for''' j = 0 '''to''' length(minterms) '''do'''
// If there is a match between the regular expression and the minterm than append a 1 otherwise 0.
'''if''' regularExpression.matches(primeImplicantminterms[j]) '''then'''
primeImplicantChart[primeImplicant] += "1"
'''else'''
Line 294:
'''if''' primeImplicant[i] == "-" '''then'''
// Add the literal character "\d".
regularExpression += @"\d";
'''else'''
regularExpression += primeImplicant[i]
'''return''' regularExpression