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 IsOneFunction IsPositiveFunction IsPositiveUnateFunctionTo IsSelfAntiDualFunction ToAndOr OneComplement PureBinary TwoComplement ToPOS Imply long() LeastSignificantDigit RadixToIndex POS real() To2LayerAndOr Solve ShortestInputsForTransition Forwardly ToStateTransitionTable FullTable HuffmanMealy SimpleCover string() TruthTable GetNegativeLogicFunction RandomGenerate ComputeFunctionOrder Zero