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 IsNegativeUnateFunctionTo IsSelfAntiDualFunction IsSymmetricFunctionTo IsUnateFunction BDD Binary OneComplement PureBinary ToTruthTable ToVariableInvertedFunction Equiv Imply Get logicvardef() MostSignificantDigit Radixes One Print real() Forwardly CreateCompactTable ShannonTree Fast Canonical Full Normalization SemanticEval var Zero