Sturmian words, Lyndon words and trees
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
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
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
Pseudopalindrome closure operators in free monoids
Theoretical Computer Science
European Journal of Combinatorics
On an involution of Christoffel words and Sturmian morphisms
European Journal of Combinatorics
On graphs of central episturmian words
Theoretical Computer Science
Sturmian and episturmian words: a survey of some recent results
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
On graphs of central episturmian words
Theoretical Computer Science
On the number of episturmian palindromes
Theoretical Computer Science
A standard correspondence on epicentral words
European Journal of Combinatorics
| Hi-index | 0.00 |
Episturmian sequences, or words, are a natural generalization of Sturmian sequences to arbitrary finite alphabets. In this paper we investigate various combinatorial properties of epicentral words, i.e., palindromic prefixes of standard episturmian words. We consider the action of certain involutions defined on epicentral words. We show that in some cases their fixed points may be characterized in terms of suitable faithful representations of epicentral words. We further show that various previously known results for central Sturmian words may be extended to epicentral words.