| LAATSTE VERZOEK |
Je bent niet ingelogd.
VORIG BEREKENINGSVERZOEK:
/*
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
VORIG BEREKENINGSRESULTAAT:
/*
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 IsThresholdFunction ToBinary PureBinary bool ToVariableInvertedFunction Diagram Load LogicScript minterm Minus NumberSystem MantissaToPositiveInteger MostSignificantDigit Radixes RadixFromIndex Or SOP Solve Sequential Backwardly ToFeedbackSystem Compatibility ShannonTree StateTransition string() TruthTable GetPositiveLogicFunction ComputeDONTCARE Zero
The website is simply translated by using the Google Translate. Please inform us if you find the wrong/funny/weird translation.