| LAST REQUEST |
You are not logged in.
PREVIOUS CALCULATION REQUEST:
/*
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
PREVIOUS CALCULATION RESULT:
/*
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
PermuteLogicFunction IsInverse IsNegativeUnateFunctionTo IsThresholdFunction IsUnateFunction And binary() binaryioset ToOrAnd ToNotFunction ToROBDD ToVariableInvertedFunction DigitalSystem minterm() PositiveDecimalToMantissa PositiveIntegerToMantissa Or Print To2LayerOrAnd To2LayerNand ShortestInputsForDistinguishTwoStates ToStateTransitionTable Compatibility BestVariableOrder StateDeviceName StateTransition RandomGenerate SemanticEval ShrinkLogicFunction Zero
The website is simply translated by using the Google Translate. Please inform us if you find the wrong/funny/weird translation.