Voir la notice de l'article provenant de la source Cambridge University Press
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/}
}
[1] 1. Adian, S. I., The Burnside Problem and Identities in Groups, Springer-Verlag, New York 1979. Google Scholar
[2] 2. Arshon, S., Demonstration de Vexistence des suites asymétriques infinies, Mat. Sb. 2 (44) (1937), 769–779. Google Scholar
[3] 3. Brown, T. C., Is there a sequence on four symbols in which no two adjacent segments are permutations of each other?, Amer. Math. Monthly 78(1971), 886–888. Google Scholar
[4] 4. Edmunds, C., personal communication. Google Scholar
[5] 5. Novikov, P. S. and Adjan, S. I., Infinite periodic groups I, II, III, Math. U.S.S.R. Izv. 2(1968) I: 209-236, II: 241-479,111:665-685. Google Scholar
[6] 6. Thue, A., UberunendlicheZeichenreihen,Norske Vid. Selsk. Skr. I. Mat. Nat. Kl. Christiana (1912), 1-67. Google Scholar
Cité par Sources :