Applications of standard Sturmian words to elementary number theory
Theoretical Computer Science
A combinatorial problem on Trapezoidal words
Theoretical Computer Science
Episturmian words and episturmian morphisms
Theoretical Computer Science
Weak repetitions in Sturmian strings
Theoretical Computer Science
A note on differentiable palindromes
Theoretical Computer Science
Harmonic and gold Sturmian words
European Journal of Combinatorics
Codes of central Sturmian words
Theoretical Computer Science - The art of theory
Palindromic factors of billiard words
Theoretical Computer Science - The art of theory
Combinatorial properties of smooth infinite words
Theoretical Computer Science
Inequalities characterizing standard Sturmian and episturmian words
Theoretical Computer Science
Smooth words over arbitrary alphabets
Theoretical Computer Science
Palindromic prefixes and episturmian words
Journal of Combinatorial Theory Series A
Pseudopalindrome closure operators in free monoids
Theoretical Computer Science
European Journal of Combinatorics
Reversals and palindromes in continued fractions
Theoretical Computer Science
A geometrical characterization of factors of multidimensional Billiard words and some applications
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 an involution of Christoffel words and Sturmian morphisms
European Journal of Combinatorics
A note on the Markoff condition and central words
Information Processing Letters
Graph connectivity, partial words, and a theorem of Fine and Wilf
Information and Computation
On a Generalization of Standard Episturmian Morphisms
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
A palindromization map for the free group
Theoretical Computer Science
Quasiperiodic and Lyndon episturmian words
Theoretical Computer Science
European Journal of Combinatorics
European Journal of Combinatorics
Compressed string-matching in standard Sturmian words
Theoretical Computer Science
Characteristic morphisms of generalized episturmian words
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
Sturmian and episturmian words: a survey of some recent results
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Counting distinct palindromes in a word in linear time
Information Processing Letters
On the number of episturmian palindromes
Theoretical Computer Science
An extension of Christoffel duality to a subset of Sturm numbers and their characteristic words
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
On a class of locally symmetric sequences: the right infinite word Λθ
MCM'11 Proceedings of the Third international conference on Mathematics and computation in music
Discrete Applied Mathematics
Central sturmian words: recent developments
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Some new results on palindromic factors of billiard words
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Complexity of degenerated three dimensional billiard words
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
A standard correspondence on epicentral words
European Journal of Combinatorics
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 characterization of bispecial sturmian words
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
A generalized palindromization map in free monoids
Theoretical Computer Science
Enumeration and structure of trapezoidal words
Theoretical Computer Science
On the least number of palindromes contained in an infinite word
Theoretical Computer Science
On the structure of bispecial Sturmian words
Journal of Computer and System Sciences
| Hi-index | 0.02 |