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 Analysis IsSymmetricFunction IsZeroFunction And GrayCode StringToBinaryNumber TwoComplement ToAndXor ToShannonTree ToVariableInvertedFunction Eq Get minterm() PositiveIntegerToMantissa To2LayerNor To2LayerAndXor Save Assign GetExcitationTable To2layerOrAnd FullTable Balanced Fast string ComputeFunctionOrder IndependentBase SemanticEval ShannonExpansion Zero

Search This Website :

 
Buy website traffic cheap