Simplification.Canonical
Back to table
/*
Logic-Function-Analysis
Simplification.Canonical
[LogicFunction g]=Simplification.Canonical(LogicFunction f);
f : a logic function
g : a logic function may in the simpler form
Simplify a logic function with the full algorithm but without removing the multi-covered logic terms.
*/
//-------------------------------------------------------------------
// examples
P=AndOr(){
1,2 ;
-1,3 ;
-1,-2,3 ;
-1,-2,-3 ;
1,2,3 ;
}
[f]=Simplification.Canonical(P);
Print(f);
//-------------------------------------------------------------------
// result
MatchLogicFunction Analysis IsBiUnateFunctionTo IsBlankFunction IsSymmetricFunction IsUnateFunction PureBinary TwoComplement binary ToNotFunction ToROBDD ToXORP Email minterm Minus RadixToIndex One OrAnd real To2LayerNor ShortestInputsForDistinguishTwoStates Compatibility Full StateTransition string() CreateFromLogicFunctions SemanticEval Xor XORP Zero