AngouriMath
Minimiser
Description
Summary
Two-level minimisation of a boolean expression by Quine-McCluskey: the minterms where
it holds are combined into prime implicants, and a cover is chosen from those.
it holds are combined into prime implicants, and a cover is chosen from those.
Remarks
The rewrite rules reach absorption and nothing past it, so
a and b or a and not b stopped at a and (b or not b) -- the factoring is
right and there is no rule to finish it, becauseb or not b has none reducing it
totrue . One classical algorithm covers that, excluded middle, non-contradiction
and every larger cover at once, where each would otherwise be its own rule.
#768
right and there is no rule to finish it, because
to
and every larger cover at once, where each would otherwise be its own rule.
#768
Members
FixedCount(AngouriMath.Functions.Boolean.Minimiser.Implicant)
MethodMaxVariables
FieldPrimeImplicants(System.Collections.Generic.List{System.Int32},System.Int32)
Method
Angouri © 2019-2023 · Project's repo · Site's repo · Octicons · Transparency · 1953 pages online