Computational Boolean Algebra

Adepto Coepi
Exempla Logicae Combinatorialis
Random Generating LogicFunction
Algebra Arithmetica
Simplicitas
DONTCARE Simplicitas
Decision Diagram binarii
Exempla Logicae Sequentialis
StateTransitionTable Huffman Simplification
StateTransitionTable Compatibility Simplification
StateTransitionTable Implementation

Compatibilitas Simplicitas enim Sequentialis Logica

Reapse multae consequentiae logicae definiri possunt cum tabula status-transitu- latione cum multis insuetis/none- riis status transitionibus. Eas dicamus partim definitas tabellam transitum civitatis.

Opus est theoriam graphi ad simpliciorem reddendam tabulam status-transitu- dinis partim definitam. Hic omittitur explicatio graphi theoriae. Nihilominus simplex est algorithmus inquisitionis inveniendae 'clique' status-transitu- tionis.

[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);

/*
Eventus sit :
[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;
    }
  }
}

*/

Adepto Coepi

Compatibilitas Simplicitas enim Sequentialis Logica

Quaere hoc Website :