| 最後的請求 |
你沒有登錄。
先前的計算請求:
/*
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
先前的計算結果:
/*
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 IsInverse IsNegativeUnateFunctionTo IsParityFunction IsSelfDualFunction MaxValue BCDEx3 NineComplement ToShannonTree FeedbackDiagram Count logicvardef() long() Nor Print To2LayerOrAnd To2LayerNand ToFullAnd SAT MaxSAT StateVariables ToStateTransitionTable Fast Full MultiCover Shannon SemanticEval ShrinkLogicFunction var() Zero
The website is simply translated by using the Google Translate. Please inform us if you find the wrong/funny/weird translation.