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
IsPositiveFunction IsPositiveUnateFunctionTo IsSymmetricFunction AndXor ToOrAnd ToSOP ToVariableInvertedFunction Diagram DiagramGateName DigitalSystem list() Count logicvardef() logicvardef minterm Or PermutationMatrix To2LayerOrAnd SOP InputVariables ToStateTransitionTable To2layerOrAnd BestVariableOrder string() TimingChart GetSubTable IndependentBase var() var Zero