ABSTRACT. Originally introduced and studied by the third and fourth authors together with J. Justin and S. Widmer (2008), rich words constitute a new class of finite and infinite words char-acterized by containing the maximal number of distinct palindromes. Several characterizations of rich words have already been established. A particularly nice characteristic property is that all ‘complete returns ’ to palindromes are palindromes. In this note, we prove that rich words are also characterized by the property that each factor is uniquely determined by its longest palindromic prefix and its longest palindromic suffix. 1
In this paper we explore various interconnections between rich words, Sturmian words, and trapezoida...
International audienceA word is called a palindrome if it is equal to its reversal. In the paper we ...
Motivated by a conjecture of Frid, Puzynina, and Zamboni, we investigate infi-nite words with the pr...
AbstractOriginally introduced and studied by the third and fourth authors together with J. Justin an...
ABSTRACT. Originally introduced and studied by the third and fourth authors together with J. Justin ...
International audienceOriginally introduced and studied by the third and fourth authors together wit...
In this paper we investigate the periodic structure of rich words (i.e., words having the highest po...
AbstractIn this paper, we study combinatorial and structural properties of a new class of finite and...
ABSTRACT. In this paper we explore various interconnections between rich words, Sturmian words, and ...
AbstractIn this paper we explore various interconnections between rich words, Sturmian words, and tr...
A finite word w of length n contains at most n + 1 distinct palindromic factors. If the bound n + 1 ...
AbstractIn this paper we study generalization of the reversal mapping realized by an arbitrary invol...
A length n word is (palindromic) rich if it contains the maximum possible number, which is n, of dis...
Generalized trapezoidal words (or GT-words for short) were introduced by A. Glen and F. Leve in 2011...
It is known that each word of length $n$ contains at most $n+1$ distinctpalindromes. A finite rich w...
In this paper we explore various interconnections between rich words, Sturmian words, and trapezoida...
International audienceA word is called a palindrome if it is equal to its reversal. In the paper we ...
Motivated by a conjecture of Frid, Puzynina, and Zamboni, we investigate infi-nite words with the pr...
AbstractOriginally introduced and studied by the third and fourth authors together with J. Justin an...
ABSTRACT. Originally introduced and studied by the third and fourth authors together with J. Justin ...
International audienceOriginally introduced and studied by the third and fourth authors together wit...
In this paper we investigate the periodic structure of rich words (i.e., words having the highest po...
AbstractIn this paper, we study combinatorial and structural properties of a new class of finite and...
ABSTRACT. In this paper we explore various interconnections between rich words, Sturmian words, and ...
AbstractIn this paper we explore various interconnections between rich words, Sturmian words, and tr...
A finite word w of length n contains at most n + 1 distinct palindromic factors. If the bound n + 1 ...
AbstractIn this paper we study generalization of the reversal mapping realized by an arbitrary invol...
A length n word is (palindromic) rich if it contains the maximum possible number, which is n, of dis...
Generalized trapezoidal words (or GT-words for short) were introduced by A. Glen and F. Leve in 2011...
It is known that each word of length $n$ contains at most $n+1$ distinctpalindromes. A finite rich w...
In this paper we explore various interconnections between rich words, Sturmian words, and trapezoida...
International audienceA word is called a palindrome if it is equal to its reversal. In the paper we ...
Motivated by a conjecture of Frid, Puzynina, and Zamboni, we investigate infi-nite words with the pr...