Words avoiding repetitions in arithmetic progressions
From MaRDI portal
Publication:2474231
DOI10.1016/j.tcs.2007.10.039zbMath1133.68066arXivmath/0608607OpenAlexW2010285287MaRDI QIDQ2474231
Manuel Silva, Jui-Yi Kao, Narad Rampersad, Jeffrey O. Shallit
Publication date: 5 March 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0608607
Related Items (5)
A New Approach to the Paperfolding Sequences ⋮ On square-free arithmetic progressions in infinite words ⋮ Avoiding Multiple Repetitions in Euclidean Spaces ⋮ Some further results on squarefree arithmetic progressions in infinite words ⋮ Repetitions in Toeplitz words and the Thue threshold
Cites Work
- Unnamed Item
- Unnamed Item
- Thue type problems for graphs, points, and numbers
- Multidimensional unrepetitive configurations
- Infinite 0-1 sequences without long adjacent identical blocks
- Folds!
- Factors of generalized Rudin-Shapiro sequences
- Canonical positions for the factors in paperfolding sequences
- On nonrepetitive sequences
- Non-repetitive tilings
- The number of factors in a paperfolding sequence
- Reading along arithmetic progressions
This page was built for publication: Words avoiding repetitions in arithmetic progressions