User:Inthar/MV3: Difference between revisions
| Line 52: | Line 52: | ||
First assume for simplicity that len(C) = 2. Then there are only three possible lengths: 2Y, 2Z, Y+Z. Suppose all 3 occur. By (*), 2Y and 2Z cannot occur within the same contiguous string. We're assuming S has at least one X. | First assume for simplicity that len(C) = 2. Then there are only three possible lengths: 2Y, 2Z, Y+Z. Suppose all 3 occur. By (*), 2Y and 2Z cannot occur within the same contiguous string. We're assuming S has at least one X. | ||
Write down and tabulate all strings that occur as in the following chart. If a string occurs, mark the corresponding box YES. If a string doesn't occur, mark the box NO. | |||
0 | |||
1 | 2Y Y+Z 2Z | ||
2 | 0 [_ _] [_ _] [_ _] | ||
3 | 1 [_ X _] [_ X _] [_ X _] | ||
2 [_ X X _] [_ X X _] [_ X X _] | |||
3 [_ X X X _] [_ X X X _] [_ X X X _] | |||
... | ... | ||