Revision as of 22:14, 29 January 2025 edit Ajmullen (talk \| contribs) 77 edits Finished the pseudocode, know possible to write the complete algorithm. Tag: Visual edit ← Previous edit		Revision as of 15:57, 30 January 2025 edit undo Dgpop (talk \| contribs) Extended confirmed users 57,675 edits MOS:NOTED Next edit →
Line 311: '''return''' essentialPrimeImplicants Using the algorithm above it is now possible to find the minimised boolean expression, by converting the essential prime implicants into the canonical form ie. <code>-100 -> BC'D'</code> and separating the implicants by [[Logical disjunction\|logical OR]]. ~~It should be noted that the~~The pseudocode assumes that the essential prime implicants will cover the entire boolean expression. ==See also==

Quine–McCluskey algorithm: Difference between revisions