1. Maxime Crochemore & Wojciech Rytter (2002): Jewels of Stringology. World Scientific Publishing Company, Incorporated, doi:10.1142/4838.
  2. James D. Currie & D. Sean Fitzpatrick (2002): Circular words avoiding patterns. Proceedings of the 6th International Conference on Developments in Language Theory. LNCS 2450., pp. 319–325, doi:10.1007/3-540-45005-X_28.
  3. Volker Diekert, Tero Harju & Dirk Nowotka (2006): Factorizations of cyclic words. Workshop on Words and Automata at CSR 7.
  4. Szilárd Zsolt Fazekas & Benedek Nagy (2008): Scattered Subword Complexity of Non-primitive Words. J. Autom. Lang. Comb. 13(3), pp. 233–247.
  5. Nathan J. Fine & Herbert S. Wilf (1965): Uniqueness theorems for periodic functions. Proceedings of the American Mathematical Society 16, pp. 109–114, doi:10.1090/S0002-9939-1965-0174934-9.
  6. D. Sean Fitzpatrick (2005): There are binary cube-free circular words of length n contained within the Thue-Morse word for all positive integers n. Ars Combinatorica 74.
  7. László Hegedüs & Benedek Nagy (2013): Periodicity of circular words. Local Proceedings of WORDS 2013, TUCS Lecture Notes 20, pp. 45–56.
  8. M. Lothaire (1983): Combinatorics on words. Addison-Wesley.
  9. M. Lothaire (2002): Algebraic Combinatorics on Words. Encyclopedia of Mathematics and its Applications 90. Cambridge University Press, doi:10.1017/CBO9781107326019.
  10. M. Lothaire (2005): Applied Combinatorics on Words. Encyclopedia of Mathematics and its Applications 105. Cambridge University Press, doi:10.1017/CBO9781107341005.
  11. Aldo de Luca & Filippo Mignosi (1994): Some combinatorial properties of Sturmian words. Theoretical Computer Science 136(2), pp. 361–385, doi:10.1016/0304-3975(94)00035-H.
  12. Roger C. Lyndon & Marcel-Paul Schützenberger (1962): The equation a^M=b^Nc^P in a free group. Michigan Math. J. 9(4), pp. 289–298, doi:10.1307/mmj/1028998766.
  13. Dirk Nowotka (2004): Periodicity and unbordered factors of words. TUCS Dissertations No. 50.
  14. Benoît Rittaud & Laurent Vivier (2011): Circular words and applications. Proceedings of Words 2011, Electronic Proceedings in Theoretical Computer Science 63, pp. 31–36, doi:10.4204/EPTCS.63.6.
  15. Benoît Rittaud & Laurent Vivier (2012): Circular words and three applications: factors of the Fibonacci word, F-adic numbers, and the sequence 1, 5, 16, 45, 121, 320,. Funct. Approx. Comment. Math. 47(2), pp. 207–231, doi:10.7169/facm/2012.47.2.6.
  16. Patrice Séébold (1985): Propriétés combinatoires des mots infinis engendrés par certains morphismes. Thèse de doctorat, Université P. et M. Curie, Institut de Programmation.
  17. Arseny M. Shur (2010): On ternary square-free circular words. The Electronic Journal of Combinatorics 17.
  18. William Smyth (2003): Computing patterns in strings. Addison-Wesley.
  19. Axel Thue (1906): Über unendliche Zeichenreihen. Kra. Vidensk. Selsk. Skrifter, I. Mat. Nat. Kl. 7, pp. 1–22.
  20. Axel Thue (1912): Über die gegenseitige Lage gleicher Teile gewisser Zeichenreihen. Kra. Vidensk. Selsk. Skrifter, I. Mat. Nat. Kl. 46, pp. 1–67.

Comments and questions to:
For website issues: