Recursive structure of MOS scales: Difference between revisions
| Line 415: | Line 415: | ||
If w₂ contains fewer complete chunks (L...Ls) or at least 2 more than w₃, we are done, since they must automatically have different numbers of s's. | If w₂ contains fewer complete chunks (L...Ls) or at least 2 more than w₃, we are done, since they must automatically have different numbers of s's. | ||
We have the following two cases, each split into subcases: | |||
Case 1 | |||
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.) | ||
| Line 448: | Line 452: | ||
(both 1.3 and 1.4 imply w₃ has one more s). | (both 1.3 and 1.4 imply w₃ has one more s). | ||
Case 2 | |||
If w₂ has one more complete chunk than w₃: | If w₂ has one more complete chunk than w₃: | ||