International audienceA finite word is u is said to be bordered if u has a proper prefix which is also a suffix of u, and unbordered otherwise. Ehrenfeucht and Silberger proved that an infinite word is purely periodic if and only if it contains only finitely many unbordered factors. We are interested in abelian and weak abelian analogues of this result; namely, we investigate the following question(s): Let w be an infinite word such that all sufficiently long factors are (weakly) abelian bordered; is w (weakly) abelian periodic? In the process we answer a question of Avgustinovich et al. concerning the abelian critical factorization theorem
International audienceIt is commonly admitted that the origin of combinatorics on words goes back to...
International audienceA word is called a palindrome if it is equal to its reversal. In the paper we ...
AbstractA finite non-empty word z is said to be a border of a finite non-empty word w if w=uz=zv for...
International audienceA finite word is u is said to be bordered if u has a proper prefix which is al...
AbstractA finite word is called bordered if it has a proper prefix which is also a suffix of that wo...
Abstract. The relationship between the length of a word and the maximum length of its unbordered fac...
Recently, Constantinescu and Ilie proved a variant of the well-known periodicity theorem o...
We write x≺yx≺y when x and y are vectors with each element of x less than or equal to the correspond...
AbstractWe prove a periodicity theorem on words that has strong analogies with the Critical Factoriz...
In the paper we study abelian versions of the critical factorization theorem. We investigate both si...
In this paper we investigate local-to-global phenomena for a new family of complexity functions of i...
International audienceIn this paper we investigate local-to-global phenomena for a new family of com...
Two words u and v are k-abelian equivalent if they contain the same number of occurrences of each...
International audienceWe consider the class P 1 of all infinite words x ∈ A ω over a finite alphabet...
In this paper we investigate local-to-global phenomena for a new family of complexity functions of i...
International audienceIt is commonly admitted that the origin of combinatorics on words goes back to...
International audienceA word is called a palindrome if it is equal to its reversal. In the paper we ...
AbstractA finite non-empty word z is said to be a border of a finite non-empty word w if w=uz=zv for...
International audienceA finite word is u is said to be bordered if u has a proper prefix which is al...
AbstractA finite word is called bordered if it has a proper prefix which is also a suffix of that wo...
Abstract. The relationship between the length of a word and the maximum length of its unbordered fac...
Recently, Constantinescu and Ilie proved a variant of the well-known periodicity theorem o...
We write x≺yx≺y when x and y are vectors with each element of x less than or equal to the correspond...
AbstractWe prove a periodicity theorem on words that has strong analogies with the Critical Factoriz...
In the paper we study abelian versions of the critical factorization theorem. We investigate both si...
In this paper we investigate local-to-global phenomena for a new family of complexity functions of i...
International audienceIn this paper we investigate local-to-global phenomena for a new family of com...
Two words u and v are k-abelian equivalent if they contain the same number of occurrences of each...
International audienceWe consider the class P 1 of all infinite words x ∈ A ω over a finite alphabet...
In this paper we investigate local-to-global phenomena for a new family of complexity functions of i...
International audienceIt is commonly admitted that the origin of combinatorics on words goes back to...
International audienceA word is called a palindrome if it is equal to its reversal. In the paper we ...
AbstractA finite non-empty word z is said to be a border of a finite non-empty word w if w=uz=zv for...
.png%3Fwidth%3D300&w=3840&q=75)
Add to ORKG