A combinatorial theorem on p-power-free words and an application to semigroups
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 24 (1990) no. 3, pp. 205-228. 
@article{ITA_1990__24_3_205_0,
     author = {de Luca, Aldo and Varricchio, Stefano},
     title = {A combinatorial theorem on $p$-power-free words and an application to semigroups},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {205--228},
     publisher = {EDP-Sciences},
     volume = {24},
     number = {3},
     year = {1990},
     mrnumber = {1072991},
     zbl = {0701.68065},
     language = {en},
     url = {http://archive.numdam.org/item/ITA_1990__24_3_205_0/}
}
TY  - JOUR
AU  - de Luca, Aldo
AU  - Varricchio, Stefano
TI  - A combinatorial theorem on $p$-power-free words and an application to semigroups
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1990
SP  - 205
EP  - 228
VL  - 24
IS  - 3
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/ITA_1990__24_3_205_0/
LA  - en
ID  - ITA_1990__24_3_205_0
ER  - 
%0 Journal Article
%A de Luca, Aldo
%A Varricchio, Stefano
%T A combinatorial theorem on $p$-power-free words and an application to semigroups
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1990
%P 205-228
%V 24
%N 3
%I EDP-Sciences
%U http://archive.numdam.org/item/ITA_1990__24_3_205_0/
%G en
%F ITA_1990__24_3_205_0
de Luca, Aldo; Varricchio, Stefano. A combinatorial theorem on $p$-power-free words and an application to semigroups. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 24 (1990) no. 3, pp. 205-228. http://archive.numdam.org/item/ITA_1990__24_3_205_0/

1. J. Berstel, Mots de Fibonacci, Seminaire d'Informatique Théorique, L.I.T.P. Université Paris-VI et VII, Année 1980/81, pp. 57-78.

2. R. D. Blyth, Rewriting Products of Groups Elements, Ph. D. Thesis, 1987, University of Illinois at Urbana-Champain. | MR

3. A. De Luca and S. Varricchio, Some Combinatorial Properties of the Thue-Morse Sequence and a Problem in Semigroups, Theoretical Computer Science, Vol. 63, 1989, pp. 333-348. | MR | Zbl

4. A. De Luca and S. Varricchio, On the Factors of the Thue-Morse Word on Three Symbols, Information Processing Letters, Vol. 27, 1988, pp. 281-285. | MR | Zbl

5. A. Ehrenfeucht and G. Rozenberg, On the Subword Compîexity of DOL Languages with a Constant Distribution, Information Processing Letters, Vol. 13, 1981, pp. 108-113. | MR | Zbl

6. A. Ehrenfeucht and G. Rozenberg, On the Subword Complexity of Square-Free DOL Languages, Theoretical Computer Science, Vol. 16, 1981, pp. 25-32. | MR | Zbl

7. J. Karhumaki, On Cube-Free w-Words Generated by Binary Morphisms, Discrete Applied Mathematics, Vol. 5, 1983, pp. 279-297. | MR | Zbl

8. M. Lothaire, Combinatorics on Words, Addition Wesley, Reading, MA, 1983. | MR | Zbl

9. A. Restivo and C. Reutenauer, On the Burnside Problem for Semigroups, J. of Algebra, Vol. 89, 1984, pp. 102-104. | MR | Zbl

10. A. Restivo, Permutation Properties and the Fibonacci Semigroup, Semigroup Forum, Vol. 38, 1989, pp. 337-345. | EuDML | MR | Zbl