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 IsSymmetricFunction IsSymmetricFunctionTo IsThresholdFunction IsUnateFunction IsZeroFunction ToAndOr OneComplement binary ToAndXor ToDiagram ToROBDD ToSOP Diagram LeastSignificantDigit MostSignificantDigit PermutationMatrix To2LayerNor To2LayerOrAnd To2LayerAndXor SAT Sequential ShannonTree MultiCover TimingChart GetPositiveLogicFunction SemanticEval var Xor Zero