Simplification.Full
Back to table
/*
Logic-Function-Analysis
Simplification.Full
[LogicFunction g]=Simplification.Full(LogicFunction f);
f : a logic function
g : a logic function may in the simpler form
Simplify a logic function with the full algorithm.
*/
//-------------------------------------------------------------------
// examples
P=AndOr(){
1,2 ;
-1,3 ;
-1,-2,3 ;
-1,-2,-3 ;
1,2,3 ;
}
[f]=Simplification.Full(P);
Print(f);
//-------------------------------------------------------------------
// result
IsBlankFunction IsSymmetricFunctionTo AndOr Binary ToAndXor ToDiagram ToDualFunction ToXORP FeedbackSystem Imply Nand LeastSignificantDigit MantissaToPositiveNumber RadixFromIndex OrAnd ToFullAnd ShortestInputsForTransition Backwardly Forwardly StateTransitionBasedly Implementation To2layerOrAnd FullTable Balanced ROBDD Canonical TruthTable AdjustLogicVariableCount CreateDummyLogicFunction Zero