Recursive structure of MOS scales: Difference between revisions
| Line 356: | Line 356: | ||
# w₃(L, s) = the last K+1 letters of W₂(L<sup>r+1</sup>s, L<sup>r</sup>s) | # w₃(L, s) = the last K+1 letters of W₂(L<sup>r+1</sup>s, L<sup>r</sup>s) | ||
If w₂ contains fewer complete chunks than w₃, we are done. | If w₂ contains fewer complete chunks (L...Ls) than w₃, we are done. | ||
If w₂ and w₃ (which have the same length) contain the same number of complete chunks, one case is (X denotes a chunk boundary, < > are chunk boundaries that are also the boundary of the word, [] are non-chunk-boundary word boundaries.) | If w₂ and w₃ (which have the same length) contain the same number of complete chunks, one case is (X denotes a chunk boundary, < > are chunk boundaries that are also the boundary of the word, [] are non-chunk-boundary word boundaries.) | ||