AbstractIn this paper we study a class of infinite words on a finite alphabet A whose factors are closed under the image of an involutory antimorphism θ of the free monoid A∗. We show that given a recurrent infinite word ω∈AN, if there exists a positive integer K such that for each n≥1 the word ω has (1) cardA+(n−1)K distinct factors of length n, and (2) a unique right and a unique left special factor of length n, then there exists an involutory antimorphism θ of the free monoid A∗ preserving the set of factors of ω
AbstractIn this paper, we study combinatorial and structural properties of a new class of finite and...
In this paper, we survey the rich theory of infinite episturmian words which generalize to any finit...
Given a finite word u, we define its palindromic length |u|pal to be the least number n such that u ...
In this paper we study a class of infinite words on a finite alphabet A whose factors are closed und...
AbstractIn this paper we study some classes of infinite words generalizing episturmian words, and an...
AbstractIn this paper we study a class of infinite words on a finite alphabet A whose factors are cl...
AbstractWe consider involutory antimorphisms ϑ of a free monoid A* and their fixed points, called ϑ-...
International audienceWe consider the class P 1 of all infinite words x ∈ A ω over a finite alphabet...
AbstractThe palindromization map ψ in a free monoid A∗ was introduced in 1997 by the first author in...
For a given finite group G consisting of morphisms and antimorphisms of a free monoid A∗, we study i...
The palindromization map ψ in a free monoid A* was introduced in 1997 by the first author in the cas...
Abstract. This paper concerns some factorizations of the Fibonacci infi-nite word. In particular, we...
In this paper, we solve some open problems related to (pseudo)palindrome closure operators and to th...
AbstractGiven a finite or infinite word v, we consider the set M(v) of minimal forbidden factors of ...
AbstractThe stabilizer of an infinite word w over a finite alphabet Σ is the monoid of morphisms ove...
AbstractIn this paper, we study combinatorial and structural properties of a new class of finite and...
In this paper, we survey the rich theory of infinite episturmian words which generalize to any finit...
Given a finite word u, we define its palindromic length |u|pal to be the least number n such that u ...
In this paper we study a class of infinite words on a finite alphabet A whose factors are closed und...
AbstractIn this paper we study some classes of infinite words generalizing episturmian words, and an...
AbstractIn this paper we study a class of infinite words on a finite alphabet A whose factors are cl...
AbstractWe consider involutory antimorphisms ϑ of a free monoid A* and their fixed points, called ϑ-...
International audienceWe consider the class P 1 of all infinite words x ∈ A ω over a finite alphabet...
AbstractThe palindromization map ψ in a free monoid A∗ was introduced in 1997 by the first author in...
For a given finite group G consisting of morphisms and antimorphisms of a free monoid A∗, we study i...
The palindromization map ψ in a free monoid A* was introduced in 1997 by the first author in the cas...
Abstract. This paper concerns some factorizations of the Fibonacci infi-nite word. In particular, we...
In this paper, we solve some open problems related to (pseudo)palindrome closure operators and to th...
AbstractGiven a finite or infinite word v, we consider the set M(v) of minimal forbidden factors of ...
AbstractThe stabilizer of an infinite word w over a finite alphabet Σ is the monoid of morphisms ove...
AbstractIn this paper, we study combinatorial and structural properties of a new class of finite and...
In this paper, we survey the rich theory of infinite episturmian words which generalize to any finit...
Given a finite word u, we define its palindromic length |u|pal to be the least number n such that u ...