Author:
Mousavi Hamoon,Shallit Jeffrey
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. Anderson, T., Loftus, J., Rampersad, N., Santean, N., Shallit, J.: Detecting palindromes, patterns and borders in regular languages. Info. Comput. 207, 1096–1118 (2009)
2. Brandenburg, F.-J.: Uniformly growing k-th power-free homomorphisms. Theoret. Comput. Sci. 23, 69–82 (1983)
3. Carpi, A.: Overlap-free words and finite automata. Theoret. Comput. Sci. 115, 243–260 (1993)
4. Currie, J.: There are ternary circular square-free words of length n for n ≥ 18. Electron. J. Comb. 9(1), Paper #N10 (2002),
http://www.combinatorics.org/ojs/index.php/eljc/article/view/v9i1n10
5. Harju, T.: On cyclically overlap-free words in binary alphabets. In: Rozenberg, G., Salomaa, A. (eds.) The Book of L, pp. 125–130. Springer (1986)