Infinite 0-1 sequences without long adjacent identical blocks
From MaRDI portal
Publication:1132880
Cites work
- 0-1-sequences of Toeplitz type
- Avoidable patterns in strings of symbols
- scientific article; zbMATH DE number 3114014 (Why is no real title available?)
- scientific article; zbMATH DE number 3117635 (Why is no real title available?)
- scientific article; zbMATH DE number 3440485 (Why is no real title available?)
- On nonrepetitive sequences
- Unending chess, symbolic dynamics and a problem in semi-groups
Cited in
(16)- Repetition-free words
- Non-repetitive sequences and Gray code
- Transcendence of Sturmian or morphic continued fractions
- Repetitions in Toeplitz words and the Thue threshold
- Words avoiding repetitions in arithmetic progressions
- Automatic Theorem-Proving in Combinatorics on Words
- Self-similar groups, automatic sequences, and unitriangular representations
- A new approach to the paperfolding sequences
- Squares and overlaps in the Thue-Morse sequence and some variants
- Generalizing the Sum of Digits Function
- Square-free shuffles of words
- Automatic theorem-proving in combinatorics on words
- Avoiding large squares in infinite binary words
- Toeplitz words, generalized periodicity and periodically iterated morphisms
- Thickness, Toeplitz words, and orientation preserving Lipschitz classification of Moran sets
- Linking the Calkin-Wilf and Stern-Brocot trees
This page was built for publication: Infinite 0-1 sequences without long adjacent identical blocks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1132880)