Repetitions in Toeplitz words and the Thue threshold
From MaRDI portal
Publication:2106611
DOI10.1007/978-3-030-51466-2_23OpenAlexW3036993596MaRDI QIDQ2106611
Publication date: 16 December 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-51466-2_23
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Sequences of linear arithmetical complexity
- The origins of combinatorics on words
- Thue type problems for graphs, points, and numbers
- Multidimensional unrepetitive configurations
- Infinite 0-1 sequences without long adjacent identical blocks
- How many squares can a string contain?
- Partial words and a theorem of Fine and Wilf
- Factors of generalized Rudin-Shapiro sequences
- Canonical positions for the factors in paperfolding sequences
- On nonrepetitive sequences
- Non-repetitive tilings
- On the minimal alphabet size in multidimensional unrepetitive configurations
- Words avoiding repetitions in arithmetic progressions
- Primitive partial words
- Arithmetic and analytic properties of paper folding sequences
- 0-1-sequences of Toeplitz type
This page was built for publication: Repetitions in Toeplitz words and the Thue threshold
