Jean-Paul Allouche
1994
Sur la complexité des suites infinies
Bulletin of the Belgium Mathematical Society
1
133–143
Jean-Paul Allouche
Jeffrey O. Shallit
2003
Automatic Sequences - Theory, Applications, Generalizations
Cambridge University Press
http://www.cambridge.org/gb/knowledge/isbn/item1170556/?site_locale=en_GB
Jean Berstel
Luc Boasson
1999
Partial Words and a Theorem of Fine and Wilf
Theor. Comput. Sci.
218
1
135–141
http://dx.doi.org/10.1016/S0304-3975(98)00255-2
Francine Blanchet-Sadri
2008
Algorithmic Combinatorics on Partial Words
Chapman & Hall/CRC Press
Boca Raton, FL
Francine Blanchet-Sadri
Aleksandar Chakarov
Lucas Manuelli
Jarett Schwartz
Slater Stich
2010
Constructing partial words with subword complexities not achievable by full words
Preprint
Francine Blanchet-Sadri
Jarett Schwartz
Slater Stich
Benjamin J. Wyatt
2010
Binary De Bruijn Partial Words with One Hole
TAMC
128–138
http://dx.doi.org/10.1007/978-3-642-13562-0_13
Julien Cassaigne
1997
Complexité et facteurs spéciaux
Bulletin of the Belgium Mathematical Society
4
1
67–88
Julien Cassaigne
2001
Recurrence in Infinite Words
STACS
1–11
http://dx.doi.org/10.1007/3-540-44693-1_1
Sébastien Ferenczi
1999
Complexity of sequences and dynamical systems
Discrete Mathematics
206
1-3
145–154
http://dx.doi.org/10.1016/S0012-365X(98)00400-2
Irina Gheorghiciuc
2007
The subword complexity of a class of infinite binary words
Advances in Applied Mathematics
39
237–259
Florin Manea
Catalin Tiseanu
2010
Hard Counting Problems for Partial Words
LATA
426–438
http://dx.doi.org/10.1007/978-3-642-13089-2_36
Marston Morse
Gustav A. Hedlund
1938
Symbolic dynamics
American Journal of Mathematics
60
815–866
G. Rauzy
1982–83
Suites à termes dans un alphabet fini
Séminaire de Théorie des Nombres de Bordeaux
25
2501–2516