The subword complexity of a class of infinite binary words
From MaRDI portal
Publication:2370831
DOI10.1016/J.AAM.2006.04.001zbMath1117.68059arXivmath/0512256OpenAlexW2021853199MaRDI QIDQ2370831
Publication date: 29 June 2007
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0512256
Related Items (5)
On the expansion of some exponential periods in an integer base ⋮ Constructing partial words with subword complexities not achievable by full words ⋮ ALGORITHMIC COMBINATORICS ON PARTIAL WORDS ⋮ Dynamics forβ-shifts and Diophantine approximation ⋮ Nombres réels de complexité sous-linéaire : mesures d'irrationalité et de transcendance
Cites Work
- Subword complexity of a generalized Thue-Morse word
- Complexity and special factors
- Complexity of sequences and dynamical systems
- Sequences with subword complexity \(2n\)
- On the complexity of infinite sequences
- Billiard complexity in rational polyhedra
- Complexity of trajectories in rectangular billiards
- The number of factors in a paperfolding sequence
- Représentation géométrique de suites de complexité $2n+1$
- Complexity of sequences defined by billiard in the cube
- Automatic Sequences
This page was built for publication: The subword complexity of a class of infinite binary words
