Add to ORKGAbstract. A maximal repetition is a non-extendable (with the same period) periodic segment in a string, in which the period repeats at least twice. In this paper we study problems related to the structure of maximal repetitions in standard Sturmian words and present the formulas for the sum of their exponents. Moreover, we show how to compute the sum of exponents of maximal repetitions in any standard Sturmian word in linear time with respect to the (total) size of its compressed representation. The presented formulas and algorithm can be easily modified to obtain the total run length of the word
The cornerstone of any algorithm computing all repetitions in a string of length $n$ in ${mathca...
AbstractIn this paper, we analyze the weak repetitions in Sturmian strings and show that an optimall...
International audienceA run is an inclusion maximal occurrence in a string (as a subinterval) of a r...
Article dans revue scientifique avec comité de lecture.A repetition in a word is a subword with the ...
Colloque avec actes et comité de lecture.A repetition in a word $w$ is a subword with the period of ...
In this paper we apply a simple representation of Sturmian strings, which we call a “reduction seque...
International audienceThe cornerstone of any algorithm computing all repetitions in a string of leng...
AbstractIn this paper we apply a simple representation of Sturmian strings, which we call a “reducti...
AbstractThe cornerstone of any algorithm computing all repetitions in strings of length n in O(n) ti...
International audienceThe cornerstone of any algorithm computing all repetitions in strings of lengt...
The exponent of a string is the quotient of its length over its smallest period. The exponent and th...
Abstract. A substring w[i..j] in w is called a repetition of period p if s[k] = s[k + p] for any i ...
AbstractA run is an inclusion maximal occurrence in a string (as a subinterval) of a repetition v wi...
Abstract. Denote by S the class of standard Sturmian words. It is a class of highly compressible wor...
AbstractWe present a simple algorithm which for an explicitly given input string pat (a pattern) and...
The cornerstone of any algorithm computing all repetitions in a string of length $n$ in ${mathca...
AbstractIn this paper, we analyze the weak repetitions in Sturmian strings and show that an optimall...
International audienceA run is an inclusion maximal occurrence in a string (as a subinterval) of a r...
Article dans revue scientifique avec comité de lecture.A repetition in a word is a subword with the ...
Colloque avec actes et comité de lecture.A repetition in a word $w$ is a subword with the period of ...
In this paper we apply a simple representation of Sturmian strings, which we call a “reduction seque...
International audienceThe cornerstone of any algorithm computing all repetitions in a string of leng...
AbstractIn this paper we apply a simple representation of Sturmian strings, which we call a “reducti...
AbstractThe cornerstone of any algorithm computing all repetitions in strings of length n in O(n) ti...
International audienceThe cornerstone of any algorithm computing all repetitions in strings of lengt...
The exponent of a string is the quotient of its length over its smallest period. The exponent and th...
Abstract. A substring w[i..j] in w is called a repetition of period p if s[k] = s[k + p] for any i ...
AbstractA run is an inclusion maximal occurrence in a string (as a subinterval) of a repetition v wi...
Abstract. Denote by S the class of standard Sturmian words. It is a class of highly compressible wor...
AbstractWe present a simple algorithm which for an explicitly given input string pat (a pattern) and...
The cornerstone of any algorithm computing all repetitions in a string of length $n$ in ${mathca...
AbstractIn this paper, we analyze the weak repetitions in Sturmian strings and show that an optimall...
International audienceA run is an inclusion maximal occurrence in a string (as a subinterval) of a r...