Similarity density of the Thue-Morse word with overlap-free infinite binary words

@inproceedings{Du2014SimilarityDO,
  title={Similarity density of the Thue-Morse word with overlap-free infinite binary words},
  author={Chen Fei Du and Jeffrey Shallit},
  booktitle={International Conference on Automata and Formal Languages},
  year={2014}
}
  • C. DuJ. Shallit
  • Published in
    International Conference on…
     21 May 2014
  • Mathematics
We consider a measure of similarity for infinite words that generalizes the notion of asymptotic or natural density of subsets of natural numbers from number theory. We show that every overlap-free infinite binary word, other than the Thue-Morse word t and its complement t bar, has this measure of similarity with t between 1/4 and 3/4. This is a partial generalization of a classical 1927 result of Mahler. 
View PDF on arXiv

Figures from this paper

References

SHOWING 1-10 OF 14 REFERENCES

Squares and overlaps in the Thue-Morse sequence and some variants

It is proved that changing any finite but nonzero number of bits in the Thue-Morse sequence creates an overlap, and any linear subsequence of the Thuesonian sequence (except those corresponding to decimation by a power of 2) contains an overlap.

On the number of alpha-power-free binary words for 2alpha<=7/3

Avoiding Approximate Squares

A variation on Axel Thue's infinite word over a 3-letter alphabet, where subwords of the form xx′ where |x| = |x′| and x and x′ are "nearly" identical is considered.

On the number of a -power-free binary words for 2 < a = 7 / 3

We study the number uα(n) of α-power-free binary words of length n, and the asymptotics of this number when n tends to infinity, for a fixed rational number α in (2, 7/3]. For any such α, we prove a…

The Ubiquitous Prouhet-Thue-Morse Sequence

The Prouhet-Thue-Morse sequence appears to be somewhat ubiquitous, and it is described many of its apparently unrelated occurrences.

Bounds for the discrete correlation of infinite sequences on k symbols and generalized Rudin-Shapiro sequences

By combinatorial means that sequences cannot be "too" different, and by an explicit construction generalizing the Rudin-Shapiro sequence, it is shown that one can achieve the maximum possible difference.

Fife's Theorem Revisited

  • J. Shallit
  • Mathematics
    Developments in Language Theory
  • 2011
We give another proof of a theorem of Fife -- understood broadly as providing a finite automaton that gives a complete description of all infinite binary overlap-free words. Our proof is…

Fife's Theorem for (7/3)-Powers

A Fife-like characterization of the infinite binary (7/3)-power-free words is proved, by giving a finite automaton of 15 states that encodes all such words that are 2-automatic.

Binary sequences which contain no $BBb$

A (one-sided) sequence or (two-sided) bisequence is irreducible provided it contains no block of the form BBb, where b is the initial symbol of the block B. Gottschalk and Hedlund [Proc. Amer. Math.…

Cellular Automata in the Cantor, Besicovitch, and Weyl Topological Spaces

The Besicovitch and Weyl pseudometrics on the space AŸ of biinfinite sequences measure the density of differences in either the central or arbitrary segments of given sequences. The Besicovitch and…