Infinite 0-1 sequences without long adjacent identical blocks

DOI10.1016/0012-365X(79)90135-3zbMath0421.05007MaRDI QIDQ1132880

Prodinger, Helmut, Friedrich J. Urbanek

Publication date: 1979

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

repetitionsnonrepetitive sequences0-1-sequencesbinary representation of the natural numbersThue

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Related Items

Transcendence of Sturmian or morphic continued fractions, Generalizing the Sum of Digits Function, Repetition-free words, Self-similar groups, automatic sequences, and unitriangular representations, Automatic Theorem-Proving in Combinatorics on Words, A New Approach to the Paperfolding Sequences, Non-repetitive sequences and Gray code, Square-free shuffles of words, AUTOMATIC THEOREM-PROVING IN COMBINATORICS ON WORDS, Toeplitz words, generalized periodicity and periodically iterated morphisms, Words avoiding repetitions in arithmetic progressions, Avoiding large squares in infinite binary words, Linking the Calkin-Wilf and Stern-Brocot trees, Squares and overlaps in the Thue-Morse sequence and some variants, A generalization of repetition threshold, Repetitions in Toeplitz words and the Thue threshold

Cites Work

• Avoidable patterns in strings of symbols
• On nonrepetitive sequences
• Unending chess, symbolic dynamics and a problem in semi-groups
• 0-1-sequences of Toeplitz type
• Unnamed Item
• Unnamed Item
• Unnamed Item