#### Vol. 9, No. 4, 2016

 Recent Issues
 The Journal About the Journal Editorial Board Editors’ Interests Subscriptions Submission Guidelines Submission Form Policies for Authors Ethics Statement ISSN: 1944-4184 (e-only) ISSN: 1944-4176 (print) Author Index Coming Soon Other MSP Journals
Avoiding approximate repetitions with respect to the longest common subsequence distance

Vol. 9 (2016), No. 4, 657–666
##### Abstract

Ochem, Rampersad, and Shallit gave various examples of infinite words avoiding what they called approximate repetitions. An approximate repetition is a factor of the form $x{x}^{\prime }$, where $x$ and ${x}^{\prime }$ are close to being identical. In their work, they measured the similarity of $x$ and ${x}^{\prime }$ using either the Hamming distance or the edit distance. In this paper, we show the existence of words avoiding approximate repetitions, where the measure of similarity between adjacent factors is based on the length of the longest common subsequence. Our principal technique is the so-called “entropy compression” method, which has its origins in Moser and Tardos’s algorithmic version of the Lovász local lemma.

However, your active subscription may be available on Project Euclid at
https://projecteuclid.org/involve

We have not been able to recognize your IP address 34.232.51.240 as that of a subscriber to this journal.
Online access to the content of recent issues is by subscription, or purchase of single articles.

or by using our contact form.

##### Keywords
approximate repetition, longest common subsequence, entropy compression
Primary: 68R15