Words without Near-Repetitions

Currie, J.; Bendor-Samuel, A.

WinnSpace home
→
Department of Mathematics and Statistics
→
James D. Currie
→
View Item

Words without Near-Repetitions

Currie, J.; Bendor-Samuel, A.

URI: http://hdl.handle.net/10680/1697

Date: 1992-06-01

DOI: 10.4153/CMB-1992-023-6

Citation:

Currie, J., and A. Bendor-Samuel. "Words without Near-Repetitions." Canadian Mathematical Bulletin 35(2) (1 June 1992): 161-166. DOI: 10.4153/CMB-1992-023-6.

Abstract:

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.

Access Level:

info:eu-repo/semantics/openAccess

Show full item record

Files in this item

Name: Words without ...

Size: 464.4Kb

Format: PDF

View/Open

This item appears in the following Collection(s)

Search WinnSpace

Browse

All of WinnSpace
This Collection
- By Issue Date
- Authors
- Titles
- Subjects

Words without Near-Repetitions

Words without Near-Repetitions

Citation:

Abstract:

Access Level:

Files in this item

This item appears in the following Collection(s)

Search WinnSpace

Browse

All of WinnSpace

This Collection

My Account