Browsing Narad Rampersad by Subject "longest common subsequence"
Now showing items 1-1 of 1
-
Avoiding approximate repetitions with respect to the longest common subsequence distance
(Mathematical Sciences Publishers, 2015-09-17)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', where x and x' are close to being identical. ...