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
IsBiUnateFunction IsSelfDualFunction AndOr binary() MaxValue MinValue OneComplement StringToBinaryNumber TwoComplement binaryioset ToDiagram DiagramGateName list() logicvardef Not LeastSignificantDigit To2LayerAndOr To2LayerAndXor Solve Save ShortestInputsForTransition InputVariables Full SimpleCover StateDeviceName TruthTable GetPositiveLogicFunction Utility AdjustLogicVariableCount Zero