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
IsBiUnateFunctionTo IsThresholdFunction IsZeroFunction AndOr Binary BCDEx3 BinaryNumberToString PureBinary binaryioset Convert ToShannonTree DiagramGateName Not NumberSystem PositiveIntegerToMantissa One Or OrAnd To2LayerNor To2LayerOrAnd Save OutputAndStateBasedly ToFeedbackSystem CreateCompactTable DontCare Full RandomGenerate ShannonExpansion var() Zero