In this note we consider the longest word, which has periods p1,...,pn, and does not have the period gcd(p1,...,pn). The length of such a word can be established by a simple algorithm. We give a short and natural way to prove that the algorithm is correct. We also give a new proof that the maximal word is a palindrome
Abstract. The relationship between the length of a word and the maximum length of its unbordered fac...
AbstractThe study of the combinatorial properties of strings of symbols from a finite alphabet, also...
Colloque avec actes et comité de lecture.A repetition in a word $w$ is a subword with the period of ...
In this note we consider the longest word, which has periods p1,...,pn, and does not have the period...
An algorithm is corrected here that was presented as Theorem 2 in [Š. Holub, RAIRO-Theor. Inf. Appl....
We consider an algorithm by Tijdeman and Zamboni constructing a word of length k thathas periods p1,...
Let w = w1 :::wn be a word of maximal length n, and with a maximal number of distinct letters for t...
AbstractLet w = w1 … wn be a word of maximal length n, and with a maximal number of distinct letters...
AbstractGiven positive integers n, and p1,…,pr, we establish a fast word combinatorial algorithm for...
Given a finite word u, we define its palindromic length |u|pal to be the least number n such that u ...
The study of repetitions in words constitutes an important stream of research both in combina-torics...
Fine and Wilf’s well-known theorem states that any word having periods p, q and length at least p + ...
AbstractIn this paper, we study word regularities and in particular extensions of the notion of the ...
Article dans revue scientifique avec comité de lecture.A repetition in a word is a subword with the ...
AbstractThe well-known Periodicity Lemma of Fine and Wilf states that if the word x of length n has ...
Abstract. The relationship between the length of a word and the maximum length of its unbordered fac...
AbstractThe study of the combinatorial properties of strings of symbols from a finite alphabet, also...
Colloque avec actes et comité de lecture.A repetition in a word $w$ is a subword with the period of ...
In this note we consider the longest word, which has periods p1,...,pn, and does not have the period...
An algorithm is corrected here that was presented as Theorem 2 in [Š. Holub, RAIRO-Theor. Inf. Appl....
We consider an algorithm by Tijdeman and Zamboni constructing a word of length k thathas periods p1,...
Let w = w1 :::wn be a word of maximal length n, and with a maximal number of distinct letters for t...
AbstractLet w = w1 … wn be a word of maximal length n, and with a maximal number of distinct letters...
AbstractGiven positive integers n, and p1,…,pr, we establish a fast word combinatorial algorithm for...
Given a finite word u, we define its palindromic length |u|pal to be the least number n such that u ...
The study of repetitions in words constitutes an important stream of research both in combina-torics...
Fine and Wilf’s well-known theorem states that any word having periods p, q and length at least p + ...
AbstractIn this paper, we study word regularities and in particular extensions of the notion of the ...
Article dans revue scientifique avec comité de lecture.A repetition in a word is a subword with the ...
AbstractThe well-known Periodicity Lemma of Fine and Wilf states that if the word x of length n has ...
Abstract. The relationship between the length of a word and the maximum length of its unbordered fac...
AbstractThe study of the combinatorial properties of strings of symbols from a finite alphabet, also...
Colloque avec actes et comité de lecture.A repetition in a word $w$ is a subword with the period of ...
DOI
Add to ORKG