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





IsInverse IsSelfDualFunction IsSymmetricFunctionTo IsThresholdFunction bool() ToPOS ToROBDD ToShannonTree DigitalSystem Eq ExcitationTable Nor MantissaToPositiveInteger MostSignificantDigit Or SOP To2LayerAndXor MaxSAT Solve TransitionSeries Forwardly BestVariableOrder FastVerificationData DontCare Shannon SimpleInner string() IndependentBase ShannonExpansion Zero

Search This Website :

 
Buy website traffic cheap