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

Authors

141

  1. LV
    Laurent Vuillon

    Université Savoie Mont Blanc, France

    8 publications · 404 citations

    8

    h-index

  2. LQ
    Luca Q. Zamboni

    Institut Camille Jordan, France

    8 publications · 413 citations

    8

    h-index

  3. AD
    Aldo de Luca

    Sapienza University of Rome, Italy

    7 publications · 753 citations

    7

    h-index

  4. FM
    Filippo Mignosi

    University of Palermo, Italy

    6 publications · 514 citations

    6

    h-index

  5. VB
    Valérie Berthé

    Centre National de la Recherche Scientifique, France

    6 publications · 344 citations

    6

    h-index

1–5 of 141

Venues

  1. Theoretical Computer Science

    28 publications · 1.6K citations

    21

    h-index

  2. European Journal of Combinatorics

    8 publications · 449 citations

    8

    h-index

  3. RAIRO - Theoretical Informatics and Applications

    ITA · 6 publications · 292 citations

    6

    h-index

  4. Discrete Mathematics

    5 publications · 287 citations

    5

    h-index

  5. Acta Arithmetica

    3 publications · 154 citations

    3

    h-index

1–5