Fewest repetitions versus maximal-exponent powers in infinite binary words

DOI10.1016/J.TCS.2011.08.011MaRDI QIDQ650894zbMATHOpenAlexFDO

Authors Golnaz Badkobeh

Publication date 7 December 2011

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2011.08.011

zbMATH Keywords

combinatorics on wordsrepetitionsword morphismsrepetitive threshold

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• Fewest repetitions in infinite binary words
• Infinite binary words containing repetitions of odd period
• Infinite words containing the minimal number of repetitions
• On the Repetition Threshold for Large Alphabets
• Infinite words containing squares at every position

Cites work

• scientific article; zbMATH DE number 5605093 (Why is no real title available?)
• scientific article; zbMATH DE number 1024080 (Why is no real title available?)
• A generator of morphisms for infinite words
• A proof of Dejean’s conjecture
• Avoiding large squares in infinite binary words
• Fewest repetitions in infinite binary words
• How many squares must a binary sequence contain?
• Last cases of Dejean's conjecture
• Polynomial versus exponential growth in repetition-free binary words
• SIMULTANEOUS AVOIDANCE OF LARGE SQUARES AND FRACTIONAL POWERS IN INFINITE BINARY WORDS
• Sur un théorème de Thue

Cited in

(11)

• Binary words with a given Diophantine exponent
• On maximal repetitions of arbitrary exponent
• Infinite words containing the minimal number of repetitions
• Characterization of some binary words with few squares
• On the existence of minimal \(\beta \)-powers
• Counting maximal-exponent factors in words
• Antisquares and critical exponents
• SIMULTANEOUS AVOIDANCE OF LARGE SQUARES AND FRACTIONAL POWERS IN INFINITE BINARY WORDS
• Polynomial versus exponential growth in repetition-free binary words
• Fewest repetitions in infinite binary words
• Infinite binary words containing repetitions of odd period

This page was built for publication: Fewest repetitions versus maximal-exponent powers in infinite binary words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q650894)