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





IsBiUnateFunction IsLinearFunction IsSelfDualFunction IsZeroFunction binary() binary ToNotFunction Eq ExcitationTable Count Load long() Or Realization SOP Save TransitionSeries AutoAssignInputAndStateVariables InputVariables Implementation To2layerOrAnd HuffmanMealy ShannonTree Fast ROBDD string Utility IndependentBase var() Zero

Search This Website :

 
Buy website traffic cheap