A Characterization of Bispecial Sturmian Words

被引:0
|
作者
Fici, Gabriele [1 ,2 ]
机构
[1] CNRS, I3S, F-75700 Paris, France
[2] Univ Nice Sophia Antipolis, Nice, France
关键词
Sturmian words; Christoffel words; special factors; minimal forbidden words; enumerative formula; FACTOR AUTOMATA; COMBINATORICS; SUFFIX;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
A finite Sturmian word w over the alphabet {a, b} is left special (resp. right special) if aw and bw (resp. wa and wb) are both Sturmian words. A bispecial Sturmian word is a Sturmian word that is both left and right special. We show as a main result that bispecial Sturmian words are exactly the maximal internal factors of Christoffel words, that are words coding the digital approximations of segments in the Euclidean plane. This result is an extension of the known relation between central words and primitive Christoffel words. Our characterization allows us to give an enumerative formula for bispecial Sturmian words. We also investigate the minimal forbidden words for the set of Sturmian words.
引用
收藏
页码:383 / 394
页数:12
相关论文
共 50 条
  • [1] On the structure of bispecial Sturmian words
    Fici, Gabriele
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2014, 80 (04) : 711 - 719
  • [2] A characterization of sturmian words by return words
    Vuillon, L
    EUROPEAN JOURNAL OF COMBINATORICS, 2001, 22 (02) : 263 - 275
  • [3] Characterization of repetitions in Sturmian words: A new proof
    Peltomaki, Jarkko
    INFORMATION PROCESSING LETTERS, 2015, 115 (11) : 886 - 891
  • [4] Return words in Sturmian and Episturmian words
    Justin, J
    Vuillon, L
    RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 2000, 34 (05): : 343 - 356
  • [5] Palindromes in Sturmian words
    de Luca, A
    De Luca, A
    DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2005, 3572 : 199 - 208
  • [6] DECIDABILITY FOR STURMIAN WORDS
    Hieronymi, Philipp
    Ma, Dun
    Oei, Reed
    Schaeffer, Luke
    Schulz, Chris
    Shallit, Jeffrey
    LOGICAL METHODS IN COMPUTER SCIENCE, 2024, 20 (03)
  • [7] Decimations and Sturmian words
    Justin, J
    Pirillo, G
    RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1997, 31 (03): : 271 - 290
  • [8] Words derivated from Sturmian words
    Araújo, IM
    Bruyère, W
    THEORETICAL COMPUTER SCIENCE, 2005, 340 (02) : 204 - 219
  • [9] Sturmian words and words with a critical exponent
    Vandeth, D
    THEORETICAL COMPUTER SCIENCE, 2000, 242 (1-2) : 283 - 300
  • [10] A note on Sturmian words
    Perrin, Dominique
    Restivo, Antonio
    THEORETICAL COMPUTER SCIENCE, 2012, 429 : 265 - 272