Author:
BALISTER PAUL,KALIKOW STEVE,SARKAR AMITES
Abstract
Define the Linus sequence Ln for n ≥ 1 as a 0–1 sequence with L1 = 0, and Ln chosen so as to minimize the length of the longest immediately repeated block Ln−2r+1 ⋅⋅⋅ Ln−r = Ln−r+1 ⋅⋅⋅ Ln. Define the Sally sequence Sn as the length r of the longest repeated block that was avoided by the choice of Ln. We prove several results about these sequences, such as exponential decay of the frequency of highly periodic subwords of the Linus sequence, zero entropy of any stationary process obtained as a limit of word frequencies in the Linus sequence and infinite average value of the Sally sequence. In addition we make a number of conjectures about both sequences.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Reference13 articles.
1. [1] Allouche J.-P. and Mendès France M. (1995) Automata and automatic sequences. In Beyond Quasicrystals (Les Houches 1994), pp. 293–367.
2. [11] Sutner K. The Ehrenfeucht–Mycielski sequence. www.cs.cmu.edu/~sutner/papers/em-sequence.pdf.
3. [10] Queffélec M. (1995) Spectral study of automatic and substitutive sequences. In Beyond Quasicrystals (Les Houches 1994), pp. 369–414.
4. Sequences with minimal block growth
5. A Pseudorandom Sequence--How Random Is It?
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Easily Bored Sequence;Topology and its Applications;2022-10