1 |
H. Bass, L. Carbone, A. Lubotzky, G. Rosenberg, and J. Tits, Tree Lattices, Birkhauser, 2001.
|
2 |
J. Cassaigne, Constructing innite words of intermediate complexity, Developments in language theory, 173-184, Lecture Notes in Comput. Sci., 2450, Springer, Berlin, 2003.
|
3 |
E. Coven and G. Hedlund, Sequences with Minimal Block Growth, Math. Systems Theory 7 (1973), 138-153.
DOI
|
4 |
X. Droubay and G. Pirillo, Palindromes and Sturmian words, Theoret. Comput. Sci. 223 (1999), no. 1-2, 73-85.
DOI
ScienceOn
|
5 |
D. Kim and S. Lim, Subword complexity and Sturmian colorings of regular trees, Ergodic Theory Dynam. Systems 35 (2015), no. 2, 461-481.
DOI
ScienceOn
|
6 |
H. Kim and S. Park, Toeplitz sequences of intermediate complexity, J. Korean Math. Soc. 48 (2011), no. 2, 383-395.
DOI
ScienceOn
|
7 |
M. Lothaire, Algebraic Combinatorics on Words, Cambridge University Press, 2002.
|
8 |
G. Rote, Sequences with Subword complexity 2n, J. Number Theory 46 (1994), no. 2, 196-213.
DOI
ScienceOn
|
9 |
J. Serre, Trees, Springer, 1980.
|