Sturmian and episturmian words: a survey of some recent results

Authors:
Jean Berstel
Affiliations:
Institut Gaspard Monge, Université Paris-Est, Marne-la-Vallée, France
Venue:
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Year:
2007

Citing 35
Cited 15

On the Number of Digital Straight Line Segments

IEEE Transactions on Pattern Analysis and Machine Intelligence
On the number of factors of Sturmian words

Theoretical Computer Science
Counting permutations with given cycle structure and descent set

Journal of Combinatorial Theory Series A
Some combinatorial properties of Sturmian words

Theoretical Computer Science
Random generation of finite Sturmian words

FPSAC '93 Proceedings of the 5th conference on Formal power series and algebraic combinatorics
Sturmian words, Lyndon words and trees

Theoretical Computer Science
Sturmian words: structure, combinatorics, and their arithmetics

Theoretical Computer Science - Special issue: formal language theory
Palindromes and Sturmian words

Theoretical Computer Science
Episturmian words and some constructions of de Luca and Rauzy

Theoretical Computer Science
Episturmian words and episturmian morphisms

Theoretical Computer Science
Generalized balances in Sturmian words

Discrete Applied Mathematics
Palindrome complexity

Theoretical Computer Science
Combinatories of Standard Sturmian Words

Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht
Burrows--Wheeler transform and Sturmian words

Information Processing Letters
Characterisations of balanced words via orderings

Theoretical Computer Science
Moments of conjugacy classes of binary words

Theoretical Computer Science
Digital straightness: a review

Discrete Applied Mathematics - The 2001 international workshop on combinatorial image analysis (IWCIA 2001)
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)

Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
Codes of central Sturmian words

Theoretical Computer Science - The art of theory
Palindromic factors of billiard words

Theoretical Computer Science - The art of theory
Maximal pattern complexity of words over l letters

European Journal of Combinatorics
Some characterizations of finite Sturmian words

Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Inequalities characterizing standard Sturmian and episturmian words

Theoretical Computer Science
A note on the Burrows-Wheeler transformation

Theoretical Computer Science
Pseudopalindrome closure operators in free monoids

Theoretical Computer Science
The structure of subword graphs and suffix trees of Fibonacci words

Theoretical Computer Science - Implementation and application of automata
On Sturmian graphs

Discrete Applied Mathematics
Factor versus palindromic complexity of uniformly recurrent infinite words

Theoretical Computer Science
On the arithmetical complexity of Sturmian words

Theoretical Computer Science
Powers in a class of A-strict standard episturmian words

Theoretical Computer Science
Some properties of the Tribonacci sequence

European Journal of Combinatorics
Characterizations of finite and infinite episturmian words via lexicographic orderings

European Journal of Combinatorics
An extension of the Burrows–Wheeler Transform

Theoretical Computer Science
On an involution of Christoffel words and Sturmian morphisms

European Journal of Combinatorics
A first investigation of Sturmian trees

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science

Quasiperiodic and Lyndon episturmian words

Theoretical Computer Science
Palindromic richness

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
On a generalization of Christoffel words: epichristoffel words

Theoretical Computer Science
On graphs of central episturmian words

Theoretical Computer Science
Infinite labeled trees: From rational to Sturmian trees

Theoretical Computer Science
Involutions of epicentral words

European Journal of Combinatorics
On the number of episturmian palindromes

Theoretical Computer Science
On theta-palindromic richness

Theoretical Computer Science
On lazy representations and sturmian graphs

CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Special factors and the combinatorics of suffix and factor automata

Theoretical Computer Science
Sturmian graphs and integer representations over numeration systems

Discrete Applied Mathematics
A standard correspondence on epicentral words

European Journal of Combinatorics
Characteristic Sturmian words are extremal for the Critical Factorization Theorem

Theoretical Computer Science
Computing the number of cubic runs in standard Sturmian words

Discrete Applied Mathematics

Quantified Score

Hi-index	0.01

Visualization

Abstract

This survey paper contains a description of some recent results concerning Sturmian and episturmian words, with particular emphasis on central words. We list fourteen characterizations of central words. We give the characterizations of Sturmian and episturmian words by lexicographic ordering, we show how the Burrows-Wheeler transform behaves on Sturmian words. We mention results on balanced episturmian words. We give a description of the compact suffix automaton of central Sturmian words.