Simplification.Full


Back to table

/*
Logic-Function-Analysis
Simplification.Full

[LogicFunction g]=Simplification.Full(LogicFunction f);

f : a logic function
g : a logic function may in the simpler form

Simplify a logic function with the full algorithm.

*/
//-------------------------------------------------------------------
// examples
P=AndOr(){ 
   1,2 ; 
   -1,3 ; 
   -1,-2,3 ; 
   -1,-2,-3 ; 
   1,2,3 ; 
}
[f]=Simplification.Full(P);
Print(f);

//-------------------------------------------------------------------
// result





IsUnateFunction AndXor ToBinary GrayCode NineComplement ToAndXor ToNotFunction ToShannonTree ToTruthTable Eq LeastSignificantDigit MantissaToPositiveInteger MostSignificantDigit PositiveDecimalToMantissa To2LayerOrAnd Backwardly OutputAndStateBasedly ToStateTransitionTable CreateCompactTable CreateCompactTableWithFullSimplification GetExcitationTable ToDigitalSystem BestVariableOrder FastVerificationData Full SimpleInner ComputeDONTCARE Normalization Substitute Zero

Search This Website :

 
Buy website traffic cheap