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 IsEqual IsLinearFunction IsSymmetricFunctionTo FromBinary BCD OneComplement StringToBinaryNumber bool() bool AddXorTerm ToNotFunction ToXORP DiagramGateName DigitalSystem Imply list() LogicScript long Nor LeastSignificantDigit MantissaToPositiveDecimal real To2LayerNor Sequential ShortestInputsForDistinguishTwoStates ToDigitalSystem To2layerOrAnd string Zero

Search This Website :

 
Buy website traffic cheap