Generator-offset property: Difference between revisions
m →Case analysis: slice now doesn't include right endpoint |
Slice [i : j] now doesn't include j |
||
| Line 33: | Line 33: | ||
* An ''odd-step'' is a ''k''-step where ''k'' is odd; an ''even-step'' is defined similarly. | * An ''odd-step'' is a ''k''-step where ''k'' is odd; an ''even-step'' is defined similarly. | ||
* Given a linear or cyclic word ''S'' with a step size X, define ''E''<sub>X</sub>(''S'') as the scale word resulting from deleting all instances of X from ''S''. | * Given a linear or cyclic word ''S'' with a step size X, define ''E''<sub>X</sub>(''S'') as the scale word resulting from deleting all instances of X from ''S''. | ||
* By a ''subword'', ''substring'', or ''slice'' of a word ''S'', denoted ''S''[''i'' : ''j''] (''j'' | * By a ''subword'', ''substring'', or ''slice'' of a word ''S'', denoted ''S''[''i'' : ''j''] (''j'' > ''i''), we mean ''S''[''i''] ''S''[''i'' + 1] ... ''S''[''j'' − 1]. | ||
** If the index ''i'' is out of bounds we first replace ''i'' with ''i'' % len(''S'') + 1 before using it as an argument in ''S''[-]. | ** If the index ''i'' is out of bounds we first replace ''i'' with ''i'' % len(''S'') + 1 before using it as an argument in ''S''[-]. | ||
* Given a mos aX bY, a ''chunk'' of X's is a maximal substring made of X's, bounded by Y's, possibly empty. We do not include the boundary Y's. | * Given a mos aX bY, a ''chunk'' of X's is a maximal substring made of X's, bounded by Y's, possibly empty. We do not include the boundary Y's. | ||