LASTA PETO

Vi ne estas ensalutinta.
ANTAŬA KALKULO-PETO:

/*
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


ANTAŬA KALKULO REZULTO:

/*
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




IsPositiveUnateFunctionTo FromBinary List NineComplement StringToBinaryNumber binary binaryioset() binaryioset ToDiagram ToDualFunction ToShannonTree Email FeedbackDiagram Count MantissaToPositiveNumber OrAnd Sequential TransitionSeries Assign InputVariables StateTransitionBasedly ToDigitalSystem To2layerOrAnd BestVariableOrder Full StateDeviceName string() string EnlargeLogicFunction Zero

Serĉu ĉi tiun retejon :

 
Buy website traffic cheap