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
AbstractWe consider one-sided infinite words generated via iteration by primitive substitutions on f...
Exact values and bounds on the k-error linear complexity of p-periodic sequences which are constant ...
AbstractIn this paper, we consider smooth words over 2-letter alphabets {a,b}, where a,b are integer...
The classical Kolakoski sequence is the unique sequence of two symbols {1, 2}, starting with 1, whic...
Our goal in this article is to review the known properties of the mysterious Kolakoski sequence and ...
The Kolakoski sequence S is the unique element of {1,2}^ω starting with 1 and coinciding with its o...
Abstract. We present some asymptotic results about the frequency of a letter appearing in a generali...
We present some asymptotic results about the frequency of a letter appearing in a generalized unidim...
Every numbering system has its own alphabet, which is used for symbolic representation of a number. ...
AbstractWe present some asymptotic results about the frequency of a letter appearing in a generalize...
This work investigates frequency distributions of strings within a text. The mathematical derivation...
The aim of this paper is to provide complementary quantitative extensions of two re-sults of H.S. Sh...
Smooth words are connected to the Kolakoski sequence. We construct the maximal and the minimal in ni...
Three new families of binary linear codes are created from a number field. They are created by looki...
Frequency analysis in cryptanalysis is based on the fact that, in any given piece of written text, c...
AbstractWe consider one-sided infinite words generated via iteration by primitive substitutions on f...
Exact values and bounds on the k-error linear complexity of p-periodic sequences which are constant ...
AbstractIn this paper, we consider smooth words over 2-letter alphabets {a,b}, where a,b are integer...
The classical Kolakoski sequence is the unique sequence of two symbols {1, 2}, starting with 1, whic...
Our goal in this article is to review the known properties of the mysterious Kolakoski sequence and ...
The Kolakoski sequence S is the unique element of {1,2}^ω starting with 1 and coinciding with its o...
Abstract. We present some asymptotic results about the frequency of a letter appearing in a generali...
We present some asymptotic results about the frequency of a letter appearing in a generalized unidim...
Every numbering system has its own alphabet, which is used for symbolic representation of a number. ...
AbstractWe present some asymptotic results about the frequency of a letter appearing in a generalize...
This work investigates frequency distributions of strings within a text. The mathematical derivation...
The aim of this paper is to provide complementary quantitative extensions of two re-sults of H.S. Sh...
Smooth words are connected to the Kolakoski sequence. We construct the maximal and the minimal in ni...
Three new families of binary linear codes are created from a number field. They are created by looki...
Frequency analysis in cryptanalysis is based on the fact that, in any given piece of written text, c...
AbstractWe consider one-sided infinite words generated via iteration by primitive substitutions on f...
Exact values and bounds on the k-error linear complexity of p-periodic sequences which are constant ...
AbstractIn this paper, we consider smooth words over 2-letter alphabets {a,b}, where a,b are integer...
DOI
Add to ORKG