Non-repetitive sequences
- 1 September 1970
- journal article
- research article
- Published by Cambridge University Press (CUP) in Mathematical Proceedings of the Cambridge Philosophical Society
- Vol. 68 (2) , 267-274
- https://doi.org/10.1017/s0305004100046077
Abstract
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.Keywords
This publication has 3 references indexed in Scilit:
- 2726. A problem on strings of beadsThe Mathematical Gazette, 1957
- 2726. A problem on strings of beadsThe Mathematical Gazette, 1957
- Unending chess, symbolic dynamics and a problem in semigroupsDuke Mathematical Journal, 1944