References

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