Optimal Bounds for the Similarity Density of the Thue-Morse Word with Overlap-Free and 73-Power-Free Infinite Binary Words

DOI10.1142/S012905411540016XzbMath1341.68143OpenAlexW2278164876MaRDI QIDQ2800416

Chen Fei Du, Arseny M. Shur, Jeffrey O. Shallit

Publication date: 15 April 2016

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s012905411540016x

zbMATH Keywords

Thue-Morse sequence7/3-power-free sequenceoverlap-free factorsimilarity density

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (1)

Subword complexity and power avoidance

Cites Work

• Overlap-free words and finite automata
• Spectral Properties of the Thue-Morse Sequence
• Squares and overlaps in the Thue-Morse sequence and some variants
• AVOIDING APPROXIMATE SQUARES
• Bounds for the discrete correlation of infinite sequences on k symbols and generalized Rudin–Shapiro sequences
• Fife’s Theorem Revisited

This page was built for publication: Optimal Bounds for the Similarity Density of the Thue-Morse Word with Overlap-Free and 73-Power-Free Infinite Binary Words