Geodesic
Words without Near-Repetitions
Canadian mathematical bulletin, Tome 35 (1992) no. 2, pp. 161-166

Voir la notice de l'article provenant de la source Cambridge

DOI

We find an infinite word w on four symbols with the following property: Two occurrences of any block in w must be separated by more than the length of the block. That is, in any subword of w of the form xyx, the length of y is greater than the length of x. This answers a question of C. Edmunds connected to the Burnside problem for groups.
DOI : 10.4153/CMB-1992-023-6
Mots-clés : 68Q, 03C. 
Currie, J.; Bendor-Samuel, A. Words without Near-Repetitions. Canadian mathematical bulletin, Tome 35 (1992) no. 2, pp. 161-166. doi: 10.4153/CMB-1992-023-6
@article{10_4153_CMB_1992_023_6,
     author = {Currie, J. and Bendor-Samuel, A.},
     title = {Words without {Near-Repetitions}},
     journal = {Canadian mathematical bulletin},
     pages = {161--166},
     year = {1992},
     volume = {35},
     number = {2},
     doi = {10.4153/CMB-1992-023-6},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1992-023-6/}
}
TY  - JOUR
AU  - Currie, J.
AU  - Bendor-Samuel, A.
TI  - Words without Near-Repetitions
JO  - Canadian mathematical bulletin
PY  - 1992
SP  - 161
EP  - 166
VL  - 35
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1992-023-6/
DO  - 10.4153/CMB-1992-023-6
ID  - 10_4153_CMB_1992_023_6
ER  - 
%0 Journal Article
%A Currie, J.
%A Bendor-Samuel, A.
%T Words without Near-Repetitions
%J Canadian mathematical bulletin
%D 1992
%P 161-166
%V 35
%N 2
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1992-023-6/
%R 10.4153/CMB-1992-023-6
%F 10_4153_CMB_1992_023_6

Cité par Sources :