Maxime Crochemore & Wojciech Rytter (2002):
Jewels of Stringology.
World Scientific Publishing Company, Incorporated,
doi:10.1142/4838.
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.
Volker Diekert, Tero Harju & Dirk Nowotka (2006):
Factorizations of cyclic words.
Workshop on Words and Automata at CSR 7.
Szilárd Zsolt Fazekas & Benedek Nagy (2008):
Scattered Subword Complexity of Non-primitive Words.
J. Autom. Lang. Comb. 13(3),
pp. 233–247.
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.
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.
László Hegedüs & Benedek Nagy (2013):
Periodicity of circular words.
Local Proceedings of WORDS 2013, TUCS Lecture Notes 20,
pp. 45–56.
M. Lothaire (1983):
Combinatorics on words.
Addison-Wesley.
M. Lothaire (2002):
Algebraic Combinatorics on Words.
Encyclopedia of Mathematics and its Applications 90.
Cambridge University Press,
doi:10.1017/CBO9781107326019.
M. Lothaire (2005):
Applied Combinatorics on Words.
Encyclopedia of Mathematics and its Applications 105.
Cambridge University Press,
doi:10.1017/CBO9781107341005.
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.
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.
Dirk Nowotka (2004):
Periodicity and unbordered factors of words.
TUCS Dissertations No. 50.
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.
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.
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.
Arseny M. Shur (2010):
On ternary square-free circular words.
The Electronic Journal of Combinatorics 17.
William Smyth (2003):
Computing patterns in strings.
Addison-Wesley.
Axel Thue (1906):
Über unendliche Zeichenreihen.
Kra. Vidensk. Selsk. Skrifter, I. Mat. Nat. Kl. 7,
pp. 1–22.
Axel Thue (1912):
Über die gegenseitige Lage gleicher Teile gewisser Zeichenreihen.
Kra. Vidensk. Selsk. Skrifter, I. Mat. Nat. Kl. 46,
pp. 1–67.