ShannonTree.ROBDD
Back to table
/*
Shannon-Tree
ShannonTree.ROBDD
[BDD tree]=ShannonTree.ROBDD(LogicFunction F);
F : a logic function
tree : a logic function in the BDD form
Generate the ROBDD (reduced and ordered binary decision diagram).
*/
//-------------------------------------------------------------------
// examples
f = AndOr()
{
2,4;
1,-3;
-1,2,3;
-1,2,3,4;
-2,-4;
}
g=ShannonTree.ROBDD(f);
Print(f,g);
//-------------------------------------------------------------------
// result
IsEqual IsMonotonicFunction IsPositiveUnateFunctionTo IsSelfAntiDualFunction IsSelfDualFunction And AndXor MinValue GrayCode bool() ToNotFunction ToShannonTree Eq Equiv LogicScript long() Nand LeastSignificantDigit MantissaToPositiveDecimal PositiveNumberToMantissa To2LayerOrAnd ShortestInputsForDistinguishTwoStates AutoAssignInputAndStateVariables CreateCompactTable ShannonTree DontCare MultiCover GetNegativeLogicFunction ComputeDONTCARE Zero