Line 346: |
Line 346: |
| |} | | |} |
| | | |
− | <pre>
| + | (NB. I will need to figure out what I meant by the following definitions.) |
− | These definitions can be made a little more succinct by | + | |
− | defining the following sorts of generic operators on strings: | + | These definitions can be made a little more succinct by defining the following sorts of generic operators on strings: |
| + | |
| + | <ol style="list-style-type:decimal"> |
| + | |
| + | <li>The ''concatenation'' <math>\operatorname{Conc}^k</math> of the <math>k\!</math> strings <math>s_j, j = 1 \ldots k,\!</math> is defined recursively as follows:</li> |
| + | |
| + | <ol style="list-style-type:lower-alpha"> |
| + | |
| + | <li><math>\operatorname{Conc}^1_j s_j \ = \ s_1.</math></li> |
| + | |
| + | <li><p>For <math>k > 1,\!</math></p> |
| | | |
− | 1. The "concatenation" Conc^k of the k strings z_j,
| + | <p><math>\operatorname{Conc}^k_j s_j \ = \ (\operatorname{Conc}^{k-1}_j s_j) \cdot s_k.</math></p></li> |
− | for j = 1 to k, is defined recursively as follows:
| |
| | | |
− | a. Conc^1_j z_j = z_1.
| + | </ol> |
| | | |
− | b. For k > 1,
| + | <li>The ''surcatenation'' <math>\operatorname{Surc}^k</math> of the <math>k\!</math> strings <math>s_j, j = 1 \ldots k,\!</math> is defined recursively as follows:</li> |
| | | |
− | Conc^k_j z_j = (Conc^(k-1)_j z_j) · z_k.
| + | <ol style="list-style-type:lower-alpha"> |
| | | |
− | 2. The "surcatenation" Surc^k of the k strings z_j,
| + | <li><math>\operatorname{Surc}^1_j s_j \ = \ ^{\backprime\backprime} \, \operatorname{(} \, ^{\prime\prime} \, \cdot s_1 \cdot \, ^{\backprime\backprime} \, \operatorname{)} \, ^{\prime\prime}.</math></li> |
− | for j = 1 to k, is defined recursively as follows:
| |
| | | |
− | a. Surc^1_j z_j = "-(" · z_1 · ")-".
| + | <li><p>For <math>k > 1,\!</math></p> |
| | | |
− | b. For k > 1, | + | <p><math>\operatorname{Surc}^k_j s_j \ = \ (\operatorname{Surc}^{k-1}_j s_j) \cdot \, (^{\backprime\backprime} \, \operatorname{)} \, ^{\prime\prime})^{-1} \cdot \, ^{\backprime\backprime} \, \operatorname{,} \, ^{\prime\prime} \, \cdot s_k \cdot \, ^{\backprime\backprime} \, \operatorname{)} \, ^{\prime\prime}.</math></p></li> |
| | | |
− | Surc^k_j z_j = (Surc^(k-1)_j z_j) · ")-"^(-1) · "," · z_k · ")-".
| + | </ol></ol> |
| | | |
| + | <pre> |
| The definitions of these syntactic operations can now be organized in a slightly | | The definitions of these syntactic operations can now be organized in a slightly |
| better fashion, for both conceptual and computational purposes, by making a few | | better fashion, for both conceptual and computational purposes, by making a few |