A Space Efficient Algorithm for the Calculation of the Digit Distribution in the Kolakoski Sequence
Combinatorics
2012-03-12 v2
Abstract
With standard algorithms for generating the classical Kolakoski sequence, the numerical calculation of the digit distribution requires a linear amount of space. Here, we present an algorithm for calculating the distribution of the digits in the classical Kolakoski sequence, that only requires a logarithmic amount of space and still runs in linear time. The algorithm is easily adaptable to generalised Kolakoski sequences.
Cite
@article{arxiv.1110.4228,
title = {A Space Efficient Algorithm for the Calculation of the Digit Distribution in the Kolakoski Sequence},
author = {Johan Nilsson},
journal= {arXiv preprint arXiv:1110.4228},
year = {2012}
}
Comments
The way of explaining the algorithm has been slightly changed, from a level-based to a tree-structure point of view. The underlying idea in the algorithm is though unchanged