On repetitions of blocks in binary sequences

DOI10.1016/0097-3165(76)90023-6MaRDI QIDQ1225054zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• A Characterization of the Morse Minimal Set
• scientific article; zbMATH DE number 3114014 (Why is no real title available?)
• On nonrepetitive sequences

Cited in

(12)

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

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

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