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
IsMonotonicFunction IsNegativeUnateFunctionTo IsParityFunction AndXor binary() Binary ToShannonTree FeedbackSystem Load Nand LeastSignificantDigit RadixToIndex object PermutationMatrix real() Realization To2LayerNor To2LayerNand ShortestInputsForDistinguishTwoStates StateVariables OutputAndStateBasedly CreateCompactTable FullTable MultiCover Shannon GetPositiveLogicFunction GetSubTable RandomGenerate Utility Zero
The website is simply translated by using the Google Translate. Please inform us if you find the wrong/funny/weird translation.