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 xx ′ , where x and x ′ are close to being identical. In their work, they measured the similarity of x and x ′ 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.(2010 Mathematics Subject Classification: 68R15)(k−1) 2 to be o(k M ). We can disregard the term k n+2 M √ πM (k−1) 2 , as it approaches 0 as M
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.