Avoiding approximate squares

Authors:
Dalia Krieger;Pascal Ochem;Narad Rampersad;Jeffrey Shallit
Affiliations:
David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, ON, Canada;LaBRI, Université Bordeaux 1, Talence Cedex, France;David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, ON, Canada;David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, ON, Canada
Venue:
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Year:
2007

Citing 5
Cited 2

Proof of Dejean's conjecture for alphabets with 5, 6, 7, 8, 9, 10 and 11 letters

Theoretical Computer Science
An Algorithm for Approximate Tandem Repeats

CPM '93 Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching
Finding approximate repetitions under Hamming distance

Theoretical Computer Science - Logic and complexity in computer science
Dejean's conjecture and Sturmian words

European Journal of Combinatorics
On the repetition threshold for large alphabets

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science

Aperiodicity Measure for Infinite Sequences

CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Repetition-freeness with Cyclic Relations and Chain Relations

Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju

Quantified Score

Hi-index	0.00

Visualization

Abstract

As is well-known, Axel Thue constructed an infinite word over a 3-letter alphabet that contains no squares, that is, no nonempty subwords of the form xx. In this paper we consider a variation on this problem, where we try to avoid approximate squares, that is, subwords of the form xx′ where |x| = |x′| and x and x′ are "nearly" identical.