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 IsThresholdFunction IsZeroFunction ToAndOr ToBinary binaryioset Convert ToAndXor AddXorTerm ToDualFunction ToPOS ToXORP DiagramGateName ExcitationTable object MaxSAT Assign To2layerOrAnd FastVerificationData ROBDD Full Shannon StateTransition string RandomGenerate Utility Normalization ShannonExpansion ShrinkLogicFunction Zero

Search This Website :

 
Buy website traffic cheap