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





IsBiUnateFunction IsParityFunction IsSelfAntiDualFunction MinValue BCD binary bool() ToDualFunction ToNotFunction ToVariableInvertedFunction Eq Count MantissaToPositiveNumber MostSignificantDigit PositiveNumberToMantissa RadixFromIndex RadixToIndex object() OrAnd Solve Forwardly ToDigitalSystem BestVariableOrder string() TimingChart TruthTable GetDontCareLogicFunction GetPositiveLogicFunction ComputeFunctionOrder Zero

Serĉu ĉi tiun retejon :

 
Buy website traffic cheap