AbstractWe consider involutory antimorphisms ϑ of a free monoid A* and their fixed points, called ϑ-palindromes or pseudopalindromes. A ϑ-palindrome reduces to a usual palindrome when ϑ is the reversal operator. For any word w∈A* the right (resp. left) ϑ-palindrome closure of w is the shortest ϑ-palindrome having w as a prefix (resp. suffix). We prove some results relating ϑ-palindrome closure operators with periodicity and conjugacy, and derive some interesting closure properties for the languages of finite Sturmian and episturmian words. In particular, a finite word w is Sturmian if and only if both its palindromic closures are so. Moreover, in such a case, both the palindromic closures of w share the same minimal period of w. A new chara...
AbstractIn this paper, we study combinatorial and structural properties of a new class of finite and...
It is known that each word of length $n$ contains at most $n+1$ distinctpalindromes. A finite rich w...
International audienceWe regard a finite word u=u_1u_2 ... u_n up to word isomorphism as an equivale...
AbstractWe consider involutory antimorphisms ϑ of a free monoid A* and their fixed points, called ϑ-...
In this paper, we solve some open problems related to (pseudo)palindrome closure operators and to th...
AbstractIn this paper we study some classes of infinite words generalizing episturmian words, and an...
AbstractThe palindromization map ψ in a free monoid A∗ was introduced in 1997 by the first author in...
The palindromization map ψ in a free monoid A* was introduced in 1997 by the first author in the cas...
AbstractFirst introduced in the study of the Sturmian words by de Luca in 1997, iterated palindromic...
First introduced in the study of the Sturmian words, the iterated palindromic closure was recently g...
International audienceFirst introduced in the study of the Sturmian words by de Luca in 1997, iterat...
In this thesis, we explore different problems at the intersection of combinatorics on words and disc...
AbstractWe give a characterization of morphisms which preserve finite and infinite standard Sturmian...
AbstractIn this paper we study a class of infinite words on a finite alphabet A whose factors are cl...
AbstractIn this paper we study generalization of the reversal mapping realized by an arbitrary invol...
AbstractIn this paper, we study combinatorial and structural properties of a new class of finite and...
It is known that each word of length $n$ contains at most $n+1$ distinctpalindromes. A finite rich w...
International audienceWe regard a finite word u=u_1u_2 ... u_n up to word isomorphism as an equivale...
AbstractWe consider involutory antimorphisms ϑ of a free monoid A* and their fixed points, called ϑ-...
In this paper, we solve some open problems related to (pseudo)palindrome closure operators and to th...
AbstractIn this paper we study some classes of infinite words generalizing episturmian words, and an...
AbstractThe palindromization map ψ in a free monoid A∗ was introduced in 1997 by the first author in...
The palindromization map ψ in a free monoid A* was introduced in 1997 by the first author in the cas...
AbstractFirst introduced in the study of the Sturmian words by de Luca in 1997, iterated palindromic...
First introduced in the study of the Sturmian words, the iterated palindromic closure was recently g...
International audienceFirst introduced in the study of the Sturmian words by de Luca in 1997, iterat...
In this thesis, we explore different problems at the intersection of combinatorics on words and disc...
AbstractWe give a characterization of morphisms which preserve finite and infinite standard Sturmian...
AbstractIn this paper we study a class of infinite words on a finite alphabet A whose factors are cl...
AbstractIn this paper we study generalization of the reversal mapping realized by an arbitrary invol...
AbstractIn this paper, we study combinatorial and structural properties of a new class of finite and...
It is known that each word of length $n$ contains at most $n+1$ distinctpalindromes. A finite rich w...
International audienceWe regard a finite word u=u_1u_2 ... u_n up to word isomorphism as an equivale...