Theoretical Computer Science
Semiperiodic words and root-conjugacy
Theoretical Computer Science
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Weak repetitions in Sturmian strings
Theoretical Computer Science
Burrows--Wheeler transform and Sturmian words
Information Processing Letters
Theoretical Computer Science
Characterisations of balanced words via orderings
Theoretical Computer Science
Moments of conjugacy classes of binary words
Theoretical Computer Science
Harmonic and gold Sturmian words
European Journal of Combinatorics
Factors of characteristic words of irrational numbers
Theoretical Computer Science
Codes of central Sturmian words
Theoretical Computer Science - The art of theory
Occurrences of palindromes in characteristic Sturmian words
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
Palindromic prefixes and episturmian words
Journal of Combinatorial Theory Series A
Pseudopalindrome closure operators in free monoids
Theoretical Computer Science
Discrete Applied Mathematics
European Journal of Combinatorics
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
European Journal of Combinatorics
On a generalization of Christoffel words: epichristoffel words
Theoretical Computer Science
On graphs of central episturmian words
Theoretical Computer Science
Suffix automata and standard sturmian 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
On the number of episturmian palindromes
Theoretical Computer Science
An Improved Bound for an Extension of Fine and Wilf’s Theorem and Its Optimality
Fundamenta Informaticae
On lazy representations and sturmian graphs
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
A challenging family of automata for classical minimization algorithms
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Theoretical Computer Science
Two linear-time algorithms for computing the minimum length polygon of a digital contour
Discrete Applied Mathematics
Sturmian graphs and integer representations over numeration systems
Discrete Applied Mathematics
Central sturmian words: recent developments
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
Sturmian graphs and a conjecture of moser
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
A new geometric approach to Sturmian words
Theoretical Computer Science
A standard correspondence on epicentral words
European Journal of Combinatorics
Locating factors of a characteristic word via the generalized Zeckendorf representation of numbers
Theoretical Computer Science
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
Characteristic Sturmian words are extremal for the Critical Factorization Theorem
Theoretical Computer Science
Subwords and Power-Free Words are not Expressible by Word Equations
Fundamenta Informaticae
Enumeration and structure of trapezoidal words
Theoretical Computer Science
On the structure of bispecial Sturmian words
Journal of Computer and System Sciences
| Hi-index | 5.26 |