Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Dejean, Françoise
1972.
Sur un théorème de Thue.
Journal of Combinatorial Theory, Series A,
Vol. 13,
Issue. 1,
p.
90.
1973.
Word Problems - Decision Problems and the Burnside Problem in Group Theory.
Vol. 71,
Issue. ,
p.
110.
Berstel, Jean
1980.
Mots sans carre et morphismes iteres.
Discrete Mathematics,
Vol. 29,
Issue. 3,
p.
235.
Guy, Richard K.
1981.
Unsolved Problems in Number Theory.
p.
110.
Crochemore, Max
1983.
Combinatorics on Words.
p.
63.
Crochemore, M.
1983.
Combinatorial Mathematics, Proceedings of the International Colloquium on Graph Theory and Combinatorics.
Vol. 75,
Issue. ,
p.
235.
Main, Michael G
and
Lorentz, Richard J
1984.
An O(n log n) algorithm for finding all repetitions in a string.
Journal of Algorithms,
Vol. 5,
Issue. 3,
p.
422.
Kobayashi, Yuji
1986.
Repetition-free words.
Theoretical Computer Science,
Vol. 44,
Issue. ,
p.
175.
Carpi, Arturo
1988.
Multidimensional unrepetitive configurations.
Theoretical Computer Science,
Vol. 56,
Issue. 2,
p.
233.
Shallit, Jeffrey
and
Wang, Ming-wei
2002.
On two-sided infinite fixed points of morphisms.
Theoretical Computer Science,
Vol. 270,
Issue. 1-2,
p.
659.
Guy, Richard K.
2004.
Unsolved Problems in Number Theory.
Vol. 1,
Issue. ,
p.
311.
Brešar, B.
Grytczuk, J.
Klavžar, S.
Niwczyk, S.
and
Peterin, I.
2007.
Nonrepetitive colorings of trees.
Discrete Mathematics,
Vol. 307,
Issue. 2,
p.
163.
Halava, Vesa
Harju, Tero
and
Kärki, Tomi
2008.
Square-free partial words.
Information Processing Letters,
Vol. 108,
Issue. 5,
p.
290.
Kurosaki, Tetsuo
2008.
Direct definition of a ternary infinite square-free sequence.
Information Processing Letters,
Vol. 106,
Issue. 5,
p.
175.
Rampersad, Narad
and
Shallit, Jeffrey
2010.
Detecting patterns in finite regular and context-free languages.
Information Processing Letters,
Vol. 110,
Issue. 3,
p.
108.
Chiniforooshan, Ehsan
Kari, Lila
and
Xu, Zhi
2010.
Developments in Language Theory.
Vol. 6224,
Issue. ,
p.
432.
Huova, Mari
Karhumäki, Juhani
and
Saarela, Aleksi
2012.
Problems in between words and abelian words: k-abelian avoidability.
Theoretical Computer Science,
Vol. 454,
Issue. ,
p.
172.
Harju, Tero
2012.
Square-free words obtained from prefixes by permutations.
Theoretical Computer Science,
Vol. 429,
Issue. ,
p.
128.
Kärki, Tomi
2013.
Combinatorics on Words.
Vol. 8079,
Issue. ,
p.
169.
Happel, Dieter
and
Zacharia, Dan
2013.
Algebras, Quivers and Representations.
Vol. 8,
Issue. ,
p.
95.