Words without Near-Repetitions
-
Published:1992-06-01
Issue:2
Volume:35
Page:161-166
-
ISSN:0008-4395
-
Container-title:Canadian Mathematical Bulletin
-
language:en
-
Short-container-title:Can. math. bull.
Author:
Currie J.,Bendor-Samuel A.
Abstract
AbstractWe 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.
Publisher
Canadian Mathematical Society
Subject
General Mathematics
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献