| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428090 | Information Processing Letters | 2009 | 4 Pages |
Abstract
In this paper we construct an infinite binary word w with the following property: the minimal distance among two occurrences of a same factor of length n cannot be polynomially upperbounded. In particular, for all positive ε the number of distinct factors of w with exponent larger than 1+ε is finite.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
