Letter Frequencies in the Kolakoski Sequence |
| J. Nilsson
Fakultät für Mathematik, Universität Bielefeld, Postfach 100131, 33501 Bielefeld, Germany |
| Full Text PDF |
| The classical Kolakoski sequence is the unique sequence of two symbols {1,2}, starting with 1, which is equal to the sequence of lengths of consecutive segments of the same symbol (run lengths). We discuss here numerical aspects of the calculation of the letter frequencies and how to find bounds for these frequencies. |
DOI: 10.12693/APhysPolA.126.549 PACS numbers: 02.70.Wz |