Some combinatorial properties of Sturmian words
Theoretical Computer Science
Sturmian words: structure, combinatorics, and their arithmetics
Theoretical Computer Science - Special issue: formal language theory
On the combinatorics of finite words
Theoretical Computer Science
Episturmian words and some constructions of de Luca and Rauzy
Theoretical Computer Science
Episturmian words and episturmian morphisms
Theoretical Computer Science
Some characterizations of finite Sturmian words
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
On different generalizations of episturmian words
Theoretical Computer Science
On a Special Class of Primitive Words
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
On a Generalization of Standard Episturmian Morphisms
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
European Journal of Combinatorics
On a Family of Morphic Images of Arnoux-Rauzy Words
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Twin-roots of words and their properties
Theoretical Computer Science
Characteristic morphisms of generalized episturmian words
Theoretical Computer Science
Fine and Wilf words for any periods II
Theoretical Computer Science
On graphs of central episturmian words
Theoretical Computer Science
On a special class of primitive words
Theoretical Computer Science
Involutions of epicentral words
European Journal of Combinatorics
Sturmian and episturmian words: a survey of some recent results
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Watson-Crick conjugate and commutative words
DNA13'07 Proceedings of the 13th international conference on DNA computing
Watson---Crick palindromes in DNA computing
Natural Computing: an international journal
DLT'10 Proceedings of the 14th international conference on Developments in language theory
An Improved Bound for an Extension of Fine and Wilf’s Theorem and Its Optimality
Fundamenta Informaticae
A relation by palindromic subwords
Natural Computing: an international journal
An extension of the Lyndon--Schützenberger result to pseudoperiodic words
Information and Computation
On the fixed points of the iterated pseudopalindromic closure operator
Theoretical Computer Science
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Hairpin completion with bounded stem-loop
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
A generalized palindromization map in free monoids
Theoretical Computer Science
Fundamenta Informaticae
Palindromic richness for languages invariant under more symmetries
Theoretical Computer Science
Hi-index | 5.24 |
We 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 characterization of finite Sturmian words follows, in terms of periodicity and special factors of their palindromic closures. Some weaker results can be extended to the episturmian case. By using the right ϕ-palindrome closure, we extend the construction of standard episturmian words via directive words. In this way one obtains a family of infinite words, called ϕ-standard words, which are morphic images of episturmian words, as well as a wider family of infinite words including the Thue-Morse word on two symbols.