Skip to search formSkip to main contentSkip to account menu

Kolakoski sequence

In mathematics, the Kolakoski sequence (named after William Kolakoski) is an infinite sequence of symbols {1,2} which is its own run-length encoding… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
ABSTRACT The Kolakoski sequence is the unique infinite sequence with values in {1, 2} and first two term 1, 2, … which equals the… 
2015
2015
Kolakoski Unit (KU) is a simple structure designed to implement the binary form of Dekking substitutions which are used to… 
2014
2014
The classical Kolakoski sequence K = (Kn) ∞ n=1 is the unique sequence on the alphabet {1, 2} de ned as the sequence of its own… 
2011
2011
The Kolakoski sequence (Kn) is perhaps one of the most famous examples of selfdescribing sequences for which some problems are… 
Review
2011
Review
2011
Our goal in this article is to review the known properties of the mysterious Kolakoski sequence and at the same time look at… 
Review
2010
Review
2010
Our goal in this article is to review the known properties of the mysterious Kolakoski sequence and at the same time look at… 
2010
2010
We investigate the recursive structure of differentiable sequences over the alphabet {1,2}. We derive a recursive formula for the… 
2006
2006
We present a recursive formula for the nth term of the Kolakoski sequence. Using this formula, it is easy to find recursions for… 
1993
1993
A moveable cart for transporting structures which are adapted for mounting upon a wall rail. The cart is constructed with a…