Recursive structure of MOS scales: Difference between revisions
| Line 415: | Line 415: | ||
Note that the latter two words have at most k s's. | Note that the latter two words have at most k s's. | ||
If w₂ contains fewer complete chunks (<L...Ls preceded by where < is the left chunk boundary) or at least 2 more than w₃, we are done, since they must automatically have different numbers of s's. It suffices to consider the case where w2 ∩ w3 contains at least k-1 complete chunks, since | If w₂ contains fewer complete chunks (<L...Ls preceded by where < is the left chunk boundary) or at least 2 more than w₃, we are done, since they must automatically have different numbers of s's. It suffices to consider the case where w2 ∩ w3 contains at least k-1 complete chunks, since otherwise W₂(L<sup>r+1</sup>s, L<sup>r</sup>s) would have at least k+1 chunks, which would contradict the length of W₂(λ, σ). | ||
Hence it suffices to consider the following two cases, each split into subcases: | Hence it suffices to consider the following two cases, each split into subcases: | ||