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





IsOneFunction IsPositiveFunction IsSelfDualFunction IsThresholdFunction BDD MinValue BCDEx3 GrayCode binaryioset bool ToNotFunction Eq Equiv FeedbackSystem Not real() real To2LayerNor ToFullAnd ShortestInputsForDistinguishTwoStates ToStateTransitionTable To2layerOrAnd Simplification BestVariableOrder GetSubTable ComputeDONTCARE EnlargeLogicFunction Normalization Substitute Zero

搜索本網站 :

 
Buy website traffic cheap