Hostname: page-component-586b7cd67f-dsjbd Total loading time: 0 Render date: 2024-11-29T18:17:34.196Z Has data issue: false hasContentIssue false
  • English
  • Français

Non-repetitive sequences

Published online by Cambridge University Press:  24 October 2008

P. A. B. Pleasants
P. A. B. Pleasants
Affiliation:
University College, Cardiff
Get access Rights & Permissions [Opens in a new window]

Extract

This note is concerned with infinite sequences whose terms are chosen from a finite set of symbols. A segment of such a sequence is a set of one or more consecutive terms, and a repetition is a pair of finite segments that are adjacent and identical. A non-repetitive sequence is one that contains no repetitions.

Type
Research Article
Information
Mathematical Proceedings of the Cambridge Philosophical Society , Volume 68 , Issue 2 , September 1970 , pp. 267 - 274
Copyright
Copyright © Cambridge Philosophical Society 1970

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

(1)Morse, M. and Hedlund, G. A.Unending chess, symbolic dynamics and a problem in semigroups. Duke Math. J. 11 (1944), 1–7.CrossRefGoogle Scholar
(2)Hawkins, D. and Mientka, W. E.On sequences which contain no repetitions. Math. Student 24 (1956), 185–187.Google Scholar
(3)Leech, J. A.A problem on strings of beads. Math. Gaz. 41 (1957), 277–278.CrossRefGoogle Scholar
(4)Erdös, P.Some unsolved problems. Magyar Tud. Akad. Mat. Kutató Int. Közl. 6 (1961), 221–254.Google Scholar