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





MatchLogicFunction IsPositiveUnateFunctionTo IsSelfAntiDualFunction IsSymmetricFunctionTo IsUnateFunctionTo And BDD Binary List PureBinary bool() ToNotFunction ToROBDD ToVariableInvertedFunction Eq MostSignificantDigit PositiveIntegerToMantissa One To2LayerNor SOP To2LayerNand SAT Sequential Backwardly ToDigitalSystem ROBDD StateTransition AdjustLogicVariableCount Xor Zero

Search This Website :

 
Buy website traffic cheap