Infinite binary words containing repetitions of odd period

DOI10.1016/j.ipl.2015.01.004zbMath1328.68154OpenAlexW2087237693WikidataQ61677840 ScholiaQ61677840MaRDI QIDQ2339599

Maxime Crochemore, Golnaz Badkobeh

Publication date: 2 April 2015

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://research.gold.ac.uk/id/eprint/29109/1/Badkobeh%2C%20G.%20%282015%29%20Infinite%20binary%20words%20containing%20repetitions%20of%20odd%20period_AAM.pdf

zbMATH Keywords

combinatorial problemsrepetitionscombinatorics on wordsword morphismsrepetitive threshold

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (1)

Density of distinct squares in non-primitive words

Cites Work

• Unnamed Item
• Infinite words containing the minimal number of repetitions
• Last cases of Dejean's conjecture
• Avoiding large squares in infinite binary words
• Fewest repetitions versus maximal-exponent powers in infinite binary words
• On repetitions of blocks in binary sequences
• How many squares must a binary sequence contain?
• On nonrepetitive sequences
• Dejean's conjecture holds for \(n\geq 30\)
• SIMULTANEOUS AVOIDANCE OF LARGE SQUARES AND FRACTIONAL POWERS IN INFINITE BINARY WORDS
• A generator of morphisms for infinite words

This page was built for publication: Infinite binary words containing repetitions of odd period