Add to ORKGWe consider an algorithm by Tijdeman and Zamboni constructing a word of length k thathas periods p1, . . . , pr, and the richest possible alphabet. We show that this algorithm can be easilystated and its correctness briefly proved using the class equivalence approach
Here, we consider a central notion of word combinatorics and string algorithmics: the periods of a s...
AbstractThe well-known Periodicity Lemma of Fine and Wilf states that if the word x of length n has ...
We consider the set G n of all period sets of strings of length n over a finite alphabet. We show th...
We consider an algorithm by Tijdeman and Zamboni constructing a word of length k thathas periods p1,...
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....
The study of repetitions in words constitutes an important stream of research both in combina-torics...
AbstractIn this paper, we study word regularities and in particular extensions of the notion of the ...
AbstractGiven positive integers n, and p1,…,pr, we establish a fast word combinatorial algorithm for...
Abstract We propose an algorithm that given as input a full word w of length n, and positive integer...
AbstractWe propose an algorithm that given as input a full word w of length n, and positive integers...
AbstractThe study of the combinatorial properties of strings of symbols from a finite alphabet (also...
Let w = w1 :::wn be a word of maximal length n, and with a maximal number of distinct letters for t...
We contribute to combinatorics and algorithmics of words by introducing new types of periodicities i...
AbstractThe study of the combinatorial properties of strings of symbols from a finite alphabet, also...
Here, we consider a central notion of word combinatorics and string algorithmics: the periods of a s...
AbstractThe well-known Periodicity Lemma of Fine and Wilf states that if the word x of length n has ...
We consider the set G n of all period sets of strings of length n over a finite alphabet. We show th...
We consider an algorithm by Tijdeman and Zamboni constructing a word of length k thathas periods p1,...
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....
The study of repetitions in words constitutes an important stream of research both in combina-torics...
AbstractIn this paper, we study word regularities and in particular extensions of the notion of the ...
AbstractGiven positive integers n, and p1,…,pr, we establish a fast word combinatorial algorithm for...
Abstract We propose an algorithm that given as input a full word w of length n, and positive integer...
AbstractWe propose an algorithm that given as input a full word w of length n, and positive integers...
AbstractThe study of the combinatorial properties of strings of symbols from a finite alphabet (also...
Let w = w1 :::wn be a word of maximal length n, and with a maximal number of distinct letters for t...
We contribute to combinatorics and algorithmics of words by introducing new types of periodicities i...
AbstractThe study of the combinatorial properties of strings of symbols from a finite alphabet, also...
Here, we consider a central notion of word combinatorics and string algorithmics: the periods of a s...
AbstractThe well-known Periodicity Lemma of Fine and Wilf states that if the word x of length n has ...
We consider the set G n of all period sets of strings of length n over a finite alphabet. We show th...