Balance properties of multi-dimensional words
Theoretical Computer Science
Episturmian words and episturmian morphisms
Theoretical Computer Science
Theoretical Computer Science
Combinatorics of Three-Interval Exchanges
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Conjugacy and episturmian morphisms
Theoretical Computer Science
m-Balanced words: a generalization of balanced words
Theoretical Computer Science
Sturmian words and a criterium by Michaux-Villemaire
Theoretical Computer Science - Combinatorics on words
Rauzy substitutions and multi-dimensional Sturmian words
Theoretical Computer Science - In memoriam: Alberto Del Lungo (1965-2003)
Inequalities characterizing standard Sturmian and episturmian words
Theoretical Computer Science
Palindromic prefixes and episturmian words
Journal of Combinatorial Theory Series A
Pseudopalindrome closure operators in free monoids
Theoretical Computer Science
Powers in a class of A-strict standard episturmian words
Theoretical Computer Science
Characterizations of finite and infinite episturmian words via lexicographic orderings
European Journal of Combinatorics
A characterization of fine words over a finite alphabet
Theoretical Computer Science
On different generalizations of episturmian words
Theoretical Computer Science
On stabilizers of infinite words
Theoretical Computer Science
On a Generalization of Standard Episturmian Morphisms
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Note: Rich, Sturmian, and trapezoidal words
Theoretical Computer Science
Quasiperiodic and Lyndon episturmian words
Theoretical Computer Science
European Journal of Combinatorics
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
Characteristic morphisms of generalized episturmian words
Theoretical Computer Science
A new characteristic property of rich words
Theoretical Computer Science
Burrows-Wheeler transform and palindromic richness
Theoretical Computer Science
On a generalization of Christoffel words: epichristoffel words
Theoretical Computer Science
On graphs of central episturmian words
Theoretical Computer Science
Involutions of epicentral words
European Journal of Combinatorics
A local balance property of episturmian words
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Sturmian and episturmian words: a survey of some recent results
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Factors of characteristic words: Location and decompositions
Theoretical Computer Science
Counting distinct palindromes in a word in linear time
Information Processing Letters
On the number of episturmian palindromes
Theoretical Computer Science
Note: Complexity and palindromic defect of infinite words
Theoretical Computer Science
Theoretical Computer Science
On the fixed points of the iterated pseudopalindromic closure operator
Theoretical Computer Science
Balancing and clustering of words in the Burrows-Wheeler transform
Theoretical Computer Science
Special factors and the combinatorics of suffix and factor automata
Theoretical Computer Science
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
On Brlek-Reutenauer conjecture
Theoretical Computer Science
Infinite words rich and almost rich in generalized palindromes
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Palindromic complexity of codings of rotations
Theoretical Computer Science
Recent results on syntactic groups of prefix codes
European Journal of Combinatorics
A standard correspondence on epicentral words
European Journal of Combinatorics
A generalized palindromization map in free monoids
Theoretical Computer Science
Proof of the Brlek-Reutenauer conjecture
Theoretical Computer Science
On the least number of palindromes contained in an infinite word
Theoretical Computer Science
Theoretical Computer Science
Introducing privileged words: Privileged complexity of Sturmian words
Theoretical Computer Science
On a generalization of Abelian equivalence and complexity of infinite words
Journal of Combinatorial Theory Series A
Palindromic richness for languages invariant under more symmetries
Theoretical Computer Science
| Hi-index | 5.26 |