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





Advanced IsBiUnateFunctionTo IsEqual IsPositiveFunction IsPositiveUnateFunctionTo And List GrayCode TwoComplement binaryioset() ToAndXor ToDiagram Load LogicScript minterm() Nand object() OrAnd StateVariables Canonical DontCare StateDeviceName CreateFromLogicFunctions ComputeDONTCARE EnlargeLogicFunction SemanticEval ShrinkLogicFunction Substitute var Zero

Search This Website :

 
Buy website traffic cheap