ShannonTree.Balanced
Back to table
/*
Shannon-Tree
ShannonTree.Balanced
[BDD tree]=ShannonTree.Balanced(LogicFunction F);
F : a logic function
tree : a logic function in the BDD form
Create the tree of the given logic-function with the balanced algorithm.
The balanced algorithm is an algorithm to decomposite the logic function with considering the positive and the negative functions simultanueously.
*/
//-------------------------------------------------------------------
// examples
f = AndOr()
{
2,4;
1,-3;
-1,2,3;
-1,2,3,4;
-2,-4;
}
g=ShannonTree.Balanced(f);
Print(f,g);
//-------------------------------------------------------------------
// result
IsBiUnateFunctionTo IsMonotonicFunction IsSelfDualFunction IsZeroFunction AndXor List binary binaryioset bool() ToDiagram ToPOS ToXORP Diagram ExcitationTable LeastSignificantDigit MantissaToPositiveDecimal PositiveNumberToMantissa RadixFromIndex RadixToIndex To2LayerOrAnd Save ShortestInputsForTransition StateTransitionBasedly ToStateTransitionTable Compatibility FullTable GetSubTable AdjustLogicVariableCount Substitute Zero