Some combinatorial properties of Sturmian words
Theoretical Computer Science
Sturmian words, Lyndon words and trees
Theoretical Computer Science
Theoretical Computer Science
Sturmian words: structure, combinatorics, and their arithmetics
Theoretical Computer Science - Special issue: formal language theory
Episturmian words and some constructions of de Luca and Rauzy
Theoretical Computer Science
Episturmian words and episturmian morphisms
Theoretical Computer Science
Automata on Infinite Words, Ecole de Printemps d'Informatique Théorique,
Combinatories of Standard Sturmian Words
Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht
Harmonic and gold Sturmian words
European Journal of Combinatorics
European Journal of Combinatorics
On an involution of Christoffel words and Sturmian morphisms
European Journal of Combinatorics
A palindromization map for the free group
Theoretical Computer Science
On graphs of central episturmian 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
On the number of episturmian palindromes
Theoretical Computer Science
Hi-index | 0.00 |
Central words are the palindromic prefixes of all standard Sturmian words. In 1997, the author introduced two different methods to generate central words. The first is based on the iteration of the right-palindromic closure operator and the second on the iteration of two standard morphisms, i.e., the Fibonacci morphism F and F@?E, where E is the interchange morphism. Moreover, it was proved that there exists a basic relation, called standard correspondence, between these two constructions. In this paper, we give an extension of the standard correspondence to the case of epicentral words, i.e., the palindromic prefixes of the standard episturmian words, introduced by Droubay et al. in 2001. Several interesting combinatorial properties of this correspondence and of some bijective operators associated to it are proved. Finally, some relations existing between the representations of epicentral words by Parikh vectors, period vectors, and trees are shown.