Convert.ToShannonTree
Back to table
/*
Logic-Function-Analysis
Convert.ToShannonTree
[BDD g]=Convert.ToShannonTree(LogicFunction f);
f : a logic function
g : a logic fucntion in the BDD form.
Compute the Shannon-Tree (No-reduced-no-reorderd BDD) of the logic object.
*/
//-------------------------------------------------------------------
// examples
f=AndOr()
{
1,-2;
-1,2;
}
g=Convert.ToShannonTree(f);
Print(f,g);
//-------------------------------------------------------------------
// result
Advanced IsCovering IsMonotonicFunction IsOneFunction IsParityFunction IsSelfAntiDualFunction And AndOr AndXor MaxValue ToBinary BinaryNumberToString bool ToROBDD Diagram Equiv FeedbackSystem Imply MantissaToPositiveInteger PositiveNumberToMantissa real() Solve Forwardly OutputAndStateBasedly TruthTable RandomGenerate ShannonExpansion var Xor Zero