In this paper, we solve some open problems related to (pseudo)palindrome closure operators and to the infinite words generated by their iteration, that is, standard episturmian and pseudostandard words. We show that if ϑ is an involutory antimorphism of A*, then the right and left ϑ-palindromic closures of any factor of a ϑ-standard word are also factors of some ϑ-standard word. We also introduce the class of pseudostandard words with “seed”, obtained by iterated pseudopalindrome closure starting from a nonempty word. We show that pseudostandard words with seed are morphic images of standard episturmian words. Moreover, we prove that for any given pseudostandard word s with seed, all sufficiently long left special factors of s are prefixes ...
International audienceIn this paper, we study generalized pseudostandard words over a two-letter alp...
We study infinite words u over an alphabet $\mathcal{A}$ satisfying the property $\mathcal{P} :~\ma...
AbstractWe study the palindrome complexity of infinite sequences on finite alphabets, i.e., the numb...
In this paper, we solve some open problems related to (pseudo)palindrome closure operators and to th...
AbstractWe consider involutory antimorphisms ϑ of a free monoid A* and their fixed points, called ϑ-...
First introduced in the study of the Sturmian words, the iterated palindromic closure was recently g...
AbstractFirst introduced in the study of the Sturmian words by de Luca in 1997, iterated palindromic...
International audienceFirst introduced in the study of the Sturmian words by de Luca in 1997, iterat...
AbstractIn this paper we study some classes of infinite words generalizing episturmian words, and an...
In this thesis, we explore different problems at the intersection of combinatorics on words and disc...
AbstractIn this paper we study generalization of the reversal mapping realized by an arbitrary invol...
The palindromization map ψ in a free monoid A* was introduced in 1997 by the first author in the cas...
AbstractIn this paper, we study combinatorial and structural properties of a new class of finite and...
AbstractThe palindromization map ψ in a free monoid A∗ was introduced in 1997 by the first author in...
AbstractWe give a characterization of the palindromes in a class of infinite words over Σ={1,2} rela...
International audienceIn this paper, we study generalized pseudostandard words over a two-letter alp...
We study infinite words u over an alphabet $\mathcal{A}$ satisfying the property $\mathcal{P} :~\ma...
AbstractWe study the palindrome complexity of infinite sequences on finite alphabets, i.e., the numb...
In this paper, we solve some open problems related to (pseudo)palindrome closure operators and to th...
AbstractWe consider involutory antimorphisms ϑ of a free monoid A* and their fixed points, called ϑ-...
First introduced in the study of the Sturmian words, the iterated palindromic closure was recently g...
AbstractFirst introduced in the study of the Sturmian words by de Luca in 1997, iterated palindromic...
International audienceFirst introduced in the study of the Sturmian words by de Luca in 1997, iterat...
AbstractIn this paper we study some classes of infinite words generalizing episturmian words, and an...
In this thesis, we explore different problems at the intersection of combinatorics on words and disc...
AbstractIn this paper we study generalization of the reversal mapping realized by an arbitrary invol...
The palindromization map ψ in a free monoid A* was introduced in 1997 by the first author in the cas...
AbstractIn this paper, we study combinatorial and structural properties of a new class of finite and...
AbstractThe palindromization map ψ in a free monoid A∗ was introduced in 1997 by the first author in...
AbstractWe give a characterization of the palindromes in a class of infinite words over Σ={1,2} rela...
International audienceIn this paper, we study generalized pseudostandard words over a two-letter alp...
We study infinite words u over an alphabet $\mathcal{A}$ satisfying the property $\mathcal{P} :~\ma...
AbstractWe study the palindrome complexity of infinite sequences on finite alphabets, i.e., the numb...