On repetitions of blocks in binary sequences

DOI10.1016/0097-3165(76)90023-6zbMath0325.05010OpenAlexW1993204836MaRDI QIDQ1225054

F. Michel Dekking

Publication date: 1976

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(76)90023-6

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Other designs, configurations (05B30)

Related Items (13)

Clusters of repetition roots: single chains ⋮ The complexity of unavoidable word patterns ⋮ Polynomial versus exponential growth in repetition-free binary words ⋮ New bounds on antipowers in words ⋮ SIMULTANEOUS AVOIDANCE OF LARGE SQUARES AND FRACTIONAL POWERS IN INFINITE BINARY WORDS ⋮ Avoiding large squares in partial words ⋮ Chains and fixing blocks in irreducible binary sequences ⋮ Avoiding large squares in infinite binary words ⋮ A propos d'une conjecture de F. Dejean sur les répétitions dans les mots ⋮ A generalization of repetition threshold ⋮ Infinite binary words containing repetitions of odd period ⋮ Sequences generated by infinitely iterated morphisms ⋮ Asymptotic repetitive threshold of balanced sequences

Cites Work

• Unnamed Item
• On nonrepetitive sequences
• A Characterization of the Morse Minimal Set

This page was built for publication: On repetitions of blocks in binary sequences