Sturmian Sequences
Sturmian Sequences is an infinite binary sequence over a two-symbol alphabet that is aperiodic, recurrent, and has exactly n+1 distinct subwords of length n for each positive integer n, thereby characterizing sequences of minimal factor complexity among aperiodic sequences in symbolic dynamics.
116
Publications
5.5K
Citations
141
Authors
122
Institutions
Publications per year
2017–2026
4
Variants
Sturmian Words
Parents
116
Symbolic Dynamics II. Sturmian Trajectories
Marston Morse, Gustav A. Hedlund · American Journal of Mathematics · 1940 · 803 citations
Sturmian words, Lyndon words and trees
Jean Berstel, Aldo de Luca · Theoretical Computer Science · 1997 · 166 citations
On the number of factors of Sturmian words
Filippo Mignosi · Theoretical Computer Science · 1991 · 147 citations
1–5 of 116
141
8
h-index
8
h-index
7
h-index
6
h-index
6
h-index
1–5 of 141
122

Centre National de la Recherche Scientifique
Paris, France
13 h-index
18 publications
721 citations
Université Paris Cité
Paris, France
11 h-index
15 publications
951 citations
Laboratoire d'Informatique Algorithmique: Fondements et Applications
Paris, France
8 h-index
9 publications
301 citations

University of Palermo
Palermo, Italy
8 h-index
15 publications
1.1K citations
Université du Québec à Montréal
Montreal, Canada
7 h-index
7 publications
315 citations
Laboratoire d'Informatique Gaspard-Monge
Champs-sur-Marne, France
6 h-index
6 publications
195 citations

University of North Texas
Denton, United States
5 h-index
6 publications
357 citations
Institut de Mathématiques de Marseille
Marseille, France
5 h-index
5 publications
251 citations
1–8 of 122
28 publications · 1.6K citations
21
h-index
8 publications · 449 citations
8
h-index
ITA · 6 publications · 292 citations
6
h-index
5 publications · 287 citations
5
h-index
3 publications · 154 citations
3
h-index
1–5