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 IsCovering IsLinearFunction IsPositiveFunction IsSelfAntiDualFunction IsSelfDualFunction IsZeroFunction And OneComplement binary binaryioset() ToTruthTable LogicScript logicvardef Minus NumberSystem MantissaToPositiveDecimal Or PermutationMatrix To2LayerNor To2LayerOrAnd SOP Implementation Compatibility ShannonTree FastVerificationData GetSubTable ComputeFunctionOrder EnlargeLogicFunction Zero

Search This Website :

 
Buy website traffic cheap