### Table 5. The axioms for merge and left merge.

2005

"... In PAGE 26: ...e., = ;), so the relation between k and k is expressed by the axiom M1 in Table5 . For a ground complete axiomatization of PA it suffices to add the first four axioms in Table 5 to the axioms of BPA.... In PAGE 26: ...n PA stands for pure interleaving (i.e., = ;), so the relation between k and k is expressed by the axiom M1 in Table 5. For a ground complete axiomatization of PA it suffices to add the first four axioms in Table5 to the axioms of BPA. Fokkink and Luttik proved in [19] that if M5 and M6 are added too, then the axiomatization is !-complete.... ..."

Cited by 13

### Table 20. Deduction rules for the left merge operator

2007

Cited by 3

### Table 2.5 Axioms for the Free and Left Merges

2000

### Table 2.5 Axioms for the Free and Left Merges

2000

### Table 2: The left- and communication merge of ACP

1994

"... In PAGE 14: ... Here I show how. Table2 shows the action rules for the two operators. The... ..."

Cited by 2

### Table 2: axioms Within BPA process expressions describing sequential processes with choices can be formulated. To add parallelism, an additional operator has to be introduced. This operator, called (free) merge and denoted as k, is de ned with the aid of an auxiliary operator , the left-merge (see table 3).

### Table 2: Merging policy: the most probable configuration of the main region is represented. Pixels that have net been merged with the main region yet are left in black.

in A 2D Dynamic Programming Approach for Markov Random Field-based Handwritten Character Recognition

"... In PAGE 10: ... Then pixels nearer to the center of the image are merged until only one region remains for the whole image. Table2 shows the most promising configuration at several steps of the merging process. Each grey level correspond to one of the 35 states.... ..."