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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.