Add to ORKGAbstract. The standard Sturmian words are extensively studied in combinatorics of words. They are enough complicated to have many interesting properties and at the same time they are highly compressible. In this paper we present compact formulas for the number ρ(3) of cubic runs in any standard word. We show also that lim |w|→∞ ρ(3)(w
Abstract. The class of finite Sturmian words consists of words having particularly simple compressed...
Communicated by Editor’s name The class of finite Sturmian words consists of words having particular...
We consider the number σ(w) of positions that do not start a square in binary words w. Letting σ(n) ...
Abstract. Denote by S the class of standard Sturmian words. It is a class of highly compressible wor...
AbstractA run is an inclusion maximal occurrence in a word (as a subinterval) of a factor in which t...
International audienceA run is an inclusion maximal occurrence in a word (as a subinterval) of a fac...
Abstract. We design an efficient algorithm computing the number of distinct cubes in a standard Stur...
International audienceA run is an inclusion maximal occurrence in a string (as a subinterval) of a f...
A run is an inclusion maximal occurrence in a string (as a subinterval) of a repetition v with a per...
We investigate the problem of the maximum number of cubic subwords (of the form www) in a given word...
AbstractWe investigate the problem of the maximum number of different cubic subwords (of the form ww...
Abstract. Denote by sq(w) the number of distinct squares in a string w and let S be the class of sta...
It is not known that the maximum number of runs in a word of length n is attained by a binary word t...
AbstractA run in a string is a nonextendable (with the same minimal period) periodic segment in a st...
A breakthrough in the field of text algorithms was the discovery of the fact that the maximal number...
Abstract. The class of finite Sturmian words consists of words having particularly simple compressed...
Communicated by Editor’s name The class of finite Sturmian words consists of words having particular...
We consider the number σ(w) of positions that do not start a square in binary words w. Letting σ(n) ...
Abstract. Denote by S the class of standard Sturmian words. It is a class of highly compressible wor...
AbstractA run is an inclusion maximal occurrence in a word (as a subinterval) of a factor in which t...
International audienceA run is an inclusion maximal occurrence in a word (as a subinterval) of a fac...
Abstract. We design an efficient algorithm computing the number of distinct cubes in a standard Stur...
International audienceA run is an inclusion maximal occurrence in a string (as a subinterval) of a f...
A run is an inclusion maximal occurrence in a string (as a subinterval) of a repetition v with a per...
We investigate the problem of the maximum number of cubic subwords (of the form www) in a given word...
AbstractWe investigate the problem of the maximum number of different cubic subwords (of the form ww...
Abstract. Denote by sq(w) the number of distinct squares in a string w and let S be the class of sta...
It is not known that the maximum number of runs in a word of length n is attained by a binary word t...
AbstractA run in a string is a nonextendable (with the same minimal period) periodic segment in a st...
A breakthrough in the field of text algorithms was the discovery of the fact that the maximal number...
Abstract. The class of finite Sturmian words consists of words having particularly simple compressed...
Communicated by Editor’s name The class of finite Sturmian words consists of words having particular...
We consider the number σ(w) of positions that do not start a square in binary words w. Letting σ(n) ...