AbstractIn this paper we study some classes of infinite words generalizing episturmian words, and analyse the relations occurring among such classes. In each case, the reversal operator R is replaced by an arbitrary involutory antimorphism ϑ of the free monoid A∗. In particular, we define the class of ϑ-words with seed, whose “standard” elements (ϑ-standard words with seed) are constructed by an iterative ϑ-palindrome closure process, starting from a finite word u0 called the seed. When the seed is empty, one obtains ϑ-words; episturmian words are exactly the R-words. One of the main theorems of the paper characterizes ϑ-words with seed as infinite words closed under ϑ and having at most one left special factor of each length n≥N (where N i...
The palindromization map ψ in a free monoid A* was introduced in 1997 by the first author in the cas...
In a recent paper with L. Q. Zamboni the authors introduced the class of $\vartheta$-episturmian wor...
In recent years, combinatorial properties of finite and infinite words have become increasingly impo...
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 ϑ-...
In this paper we study a class of infinite words on a finite alphabet A whose factors are closed und...
AbstractIn a recent paper with L.Q. Zamboni, the authors introduced the class of ϑ-episturmian words...
In this paper, we solve some open problems related to (pseudo)palindrome closure operators and to th...
AbstractIn this paper, we study combinatorial and structural properties of a new class of finite and...
AbstractIn this paper we study infinite episturmian words which are a natural generalization of Stur...
In this paper, we survey the rich theory of infinite episturmian words which generalize to any finit...
In a recent paper with L. Q. Zamboni, the authors introduced the class of ϑ-episturmian words. An in...
AbstractLet w be an infinite word on an alphabet A. We denote by (ni)i⩾1 the increasing sequence (as...
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...
In a recent paper with L. Q. Zamboni the authors introduced the class of $\vartheta$-episturmian wor...
In recent years, combinatorial properties of finite and infinite words have become increasingly impo...
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 ϑ-...
In this paper we study a class of infinite words on a finite alphabet A whose factors are closed und...
AbstractIn a recent paper with L.Q. Zamboni, the authors introduced the class of ϑ-episturmian words...
In this paper, we solve some open problems related to (pseudo)palindrome closure operators and to th...
AbstractIn this paper, we study combinatorial and structural properties of a new class of finite and...
AbstractIn this paper we study infinite episturmian words which are a natural generalization of Stur...
In this paper, we survey the rich theory of infinite episturmian words which generalize to any finit...
In a recent paper with L. Q. Zamboni, the authors introduced the class of ϑ-episturmian words. An in...
AbstractLet w be an infinite word on an alphabet A. We denote by (ni)i⩾1 the increasing sequence (as...
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...
In a recent paper with L. Q. Zamboni the authors introduced the class of $\vartheta$-episturmian wor...
In recent years, combinatorial properties of finite and infinite words have become increasingly impo...