Simplifikazzjoni tal-Kompatibbiltà Għal Loġika Sekwenzjali
Fir-realtà, ħafna loġika sekwenzjali jistgħu jiġu definiti bit-tabella tat-tranżizzjoni tal-istat b'ħafna tranżizzjonijiet tal-istat mhux użati/irrelevanti. Ejja nsejħu dawn bħala parzjalment definiti state-transition-table.
Għandna bżonn it-teorija tal-graff biex tissimplifika tabella ta' tranżizzjoni tal-istat parzjalment definita. Hawn, naqbżu l-ispjegazzjoni tat-teorija tal-graffs. Madankollu, għandna algoritmu ta' tiftix sempliċi biex insibu l-'klikka' tat-tabella tat-transizzjoni tal-istat.
[table]=StateTransition()
{
transitions
{
1: [1] -> 1/1'b0, [2] -> 4/1'b0, /* */ [4] -> 2/1'b1;
2: [1] -> 3/1'b1, /* */ /* */ [4] -> 2/1'b1;
3: [1] -> 3/1'b1, [2] -> 4/1'b0, /* */ [4] -> 2/1'b1;
4: [1] -> 1/1'b0, [2] -> 4/1'b0 /* */ /* */;
}
}
[simtable]=Simplification.Compatibility(table);
Print("result:");
Print(simtable);
/*
Ir-riżultat għandu jkun :
[table]=StateTransition()
{
transitions
{
1: [1] -> 1/1'b0, [2] -> 4/1'b0, [4] -> 2/1'b1;
2: [1] -> 3/1'b1, [4] -> 2/1'b1;
3: [1] -> 3/1'b1, [2] -> 4/1'b0, [4] -> 2/1'b1;
4: [1] -> 1/1'b0, [2] -> 4/1'b0 ;
}
simplification
{
tabletype = "incompletely-defined" ;
algorithm = "compatibility" ;
grouping
{
1:1,4;
2:2,3;
}
transitions
{
1: [1] -> 1/1'b0, [2] -> 1/1'b0, [4] -> 2/1'b1;
2: [1] -> 2/1'b1, [2] -> 1/1'b0, [4] -> 2/1'b1;
}
}
}
*/
IsBiUnateFunction IsBiUnateFunctionTo IsBlankFunction IsCovering IsEqual IsLinearFunction IsPositiveUnateFunctionTo AndOr BinaryNumberToString ToDiagram ToSOP DiagramGateName list() long() minterm PositiveDecimalToMantissa To2LayerNor To2LayerAndOr MaxSAT ShortestInputsForDistinguishTwoStates Forwardly StateVariables OutputAndStateBasedly Fast SimpleCover string Utility AdjustLogicVariableCount var() Zero
The website is simply translated by using the Google Translate. Please inform us if you find the wrong/funny/weird translation.