Tower-type bounds for unavoidable patterns in words
A word w is said to contain the pattern P if there is a way to substitute a nonempty word for each letter in P so that the resulting word is a subword of w. Bean, Ehrenfeucht and McNulty and, independently, Zimin characterised the patterns P which are unavoidable, in the sense that any sufficiently...
| Main Authors: | , , |
|---|---|
| Format: | Journal article |
| Published: |
American Mathematical Society
2019
|