Results 1 to 10 of about 359 (107)
Decidability for Sturmian words [PDF]
Logical Methods in Computer Science, 2022 We show that the first-order theory of Sturmian words over Presburger arithmetic is decidable. Using a general adder recognizing addition in Ostrowski numeration systems by Baranwal, Schaeffer and Shallit, we prove that the first-order expansions of ...
Philipp Hieronymi +5 more
doaj +6 more sources
Abelian returns in Sturmian words [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 In this paper we study an abelian version of the notion of return word. Our main result is a new characterization of Sturmian words via abelian returns. Namely, we prove that a word is Sturmian if and only if each of its factors has two or three abelian ...
Svetlana Puzynina, Luca Q. Zamboni
doaj +11 more sources
Palindromes and Sturmian words
Theoretical Computer Science, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Giuseppe Pirillo
exaly +3 more sources
Words derivated from Sturmian words
Theoretical Computer Science, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Véronique Bruyere
exaly +6 more sources
Sturmian images of non Sturmian words and standard morphisms
Theoretical Computer Science, 2018 Sturmian sequences, which can be defined as codings of irrational rotations on the unit circle, and morphic sequences, which are obtained by taking the pointwise image of iterative fixed points of morphims of the free monoid, are two families of ``simple'' sequences, in the sense that they are somehow ``close'' (in distinct ways) to periodic sequences.
Patrice Séébold, Séébold, Patrice
exaly +3 more sources
Quasiperiodic Sturmian words and morphisms
Theoretical Computer Science, 2007 We characterize all quasiperiodic Sturmian words: a Sturmian word is not quasiperiodic if and only if it is a Lyndon word. Moreover, we study links between Sturmian morphisms and quasiperiodicity.
Florence Levé, Gwénaël Richomme
exaly +5 more sources
On the arithmetical complexity of Sturmian words
Theoretical Computer Science, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Julien Cassaigne, Anna E. Frid
exaly +4 more sources
On the structure of bispecial Sturmian words
Journal of Computer and System Sciences, 2014 A balanced word is one in which any two factors of the same length contain the same number of each letter of the alphabet up to one. Finite binary balanced words are called Sturmian words. A Sturmian word is bispecial if it can be extended to the left and to the right with both letters remaining a Sturmian word.
Gabriele Fici
exaly +4 more sources
Sturmian words, β-shifts, and transcendence
Theoretical Computer Science, 2004 21 pages ...
Dong Pyo Chi, DoYong Kwon
exaly +3 more sources
Fractional powers in Sturmian words
Theoretical Computer Science, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jacques Justin
exaly +2 more sources