Quine–McCluskey algorithm: Difference between revisions

Content deleted Content added

Inline

Revision as of 12:11, 13 November 2004

Quine-McCluskey algorithm is a method used for minimisation of boolean functions.

The method involves:

Finding all prime implicants of the function.
Using those prime implicants to find the essential prime implicants of the function, as well as using other prime implicants that are necessary to cover the function.

This article is a stub. You can help Wikipedia by expanding it.

@@ Line 2: / Line 2: @@
 The method involves:
-* 1. Finding all [[prime implicant]]s of the function.
+#Finding all [[prime implicant]]s of the function.
-* 2. Using those prime implicants to find the [[essential prime implicant]]s of the function, as well as using other prime implicants that are necessary to cover the function.
+#Using those prime implicants to find the [[essential prime implicant]]s of the function, as well as using other prime implicants that are necessary to cover the function.
 ==See also==