More Kolakoski Sequences
classification
🧮 math.CO
keywords
sequenceskolakoskiletterlookotherwillalphabetsarbitrary
read the original abstract
Our goal in this article is to review the known properties of the mysterious Kolakoski sequence and at the same time look at generalizations of it over arbitrary two letter alphabets. Our primary focus will here be the case where one of the letters is odd while the other is even, since in the other cases the sequences in question can be rewritten as (well-known) primitive substitution sequences. We will look at word and letter frequencies, squares, palindromes and complexity.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
The complexity of finite smooth words over binary alphabets
f-smooth words are precisely the factors of smooth words, with complexity growing as Θ(n^{log(a+b)/log((a+b)/2)}) proven for even alphabets, lower bound for all binary, and tighter upper bound for odd alphabets.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.