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





IsOneFunction IsThresholdFunction AndOr Binary ToBinary binaryioset() bool ToOrAnd ToSOP ToVariableInvertedFunction ToXORP Eq Equiv LogicScript minterm() MostSignificantDigit PositiveDecimalToMantissa One OrAnd real() SOP Save StateTransitionBasedly ToStateTransitionTable string() GetDontCareLogicFunction RandomGenerate Utility SemanticEval Zero

Search This Website :

 
Buy website traffic cheap