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
Analysis IsBlankFunction IsSelfAntiDualFunction IsZeroFunction BCDEx3 GrayCode OneComplement binary binaryioset() bool() ToDualFunction ToVariableInvertedFunction Get logicvardef() long() MantissaToPositiveDecimal MostSignificantDigit Or Print real SOP Solve ShortestInputsForTransition StateVariables OutputAndStateBasedly StateTransitionBasedly Compatibility Balanced GetPositiveLogicFunction Zero