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 IsBlankFunction IsLinearFunction IsThresholdFunction binary() ToBinary binaryioset() ToOrAnd ToDualFunction ToNotFunction ToSOP LogicScript logicvardef() long NumberSystem PositiveDecimalToMantissa RadixFromIndex To2LayerAndOr MaxSAT Sequential ToFeedbackSystem CreateCompactTable HuffmanMealy Shannon SimpleCover StateDeviceName GetPositiveLogicFunction RandomGenerate ComputeFunctionOrder Zero

Search This Website :

 
Buy website traffic cheap