Results 11 to 20 of about 1,318,046 (112)
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 +8 more sources
Lyndon factorization of sturmian words [PDF]
Discrete Mathematics, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Melançon, Guy, Guy Melançon
openaire +4 more sources
Various Properties of Sturmian Words [PDF]
Acta Polytechnica, 2005 This overview paper is devoted to Sturmian words. The first part summarizes different characterizations of Sturmian words. Besides the well known theorem of Hedlund and Morse it also includes recent results on the characterization of Sturmian words using
P. Baláži
doaj +2 more sources
Sturmian morphisms and \(\alpha\)-words [PDF]
Theor. Comput. Sci., 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chuan Wai-Fong, Wai-Fong, Chuan
openaire +3 more sources
Sturmian words with balanced construction [Elektronisk resurs]
, 2009 In this paper we define Sturmian words with balanced construction. We formulate a fixed-point theorem for Sturmian words and analyze the set of all fixed points.
Uscka-Wehlou, Hanna,
core +9 more sources
Sturmian Words: Dynamical Systems and Derivated Words
, 2005 In a preceding article, we have studied the family of words derivated from characteristic Sturmian words. This study has lead to a new proof of the characterization of characteristic Sturmian words which are fixed points of morphisms. In this article, we extend this approach to all Sturmian words.
Araújo, Isabel M., Bruyère, Véronique
core +5 more sources
Privileged Words and Sturmian Words [PDF]
, 2016 This dissertation has two almost unrelated themes: privileged words and Sturmian words. Privileged words are a new class of words introduced recently.
Peltomäki, Jarkko
openaire +3 more sources
Decimations and sturmian words [PDF]
RAIRO - Theoretical Informatics and Applications, 1997 Summary: Standard Sturmian infinite words have a curious property discovered by G. Rauzy. If in such a word we delete all occurrences of each letter, except every \(p\)th one, then we get the some infinite word. This property and several generalizations are studied here.
Jacques Justin, Giuseppe Pirillo
openaire +2 more sources
On infinite permutations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We define an infinite permutation as a sequence of reals taken up to the order, or, equivalently, as a linear ordering of a finite or countable set. Then we introduce and characterize periodic permutations; surprisingly, for each period $t$ there is an ...
Dmitri G. Fon-Der-Flaass, Anna E. Frid
doaj +1 more source
A remark on morphic sturmian words [PDF]
RAIRO - Theoretical Informatics and Applications, 1994 Summary: This note deals with binary Sturmian words that are morphic, i.e. generated by iterating a morphism. Among these, characteristic words are a well-known subclass. We prove that for every characteristic morphic word \(x\), the four words \(ax\), \(bx\), \(abx\) and \(bax\) are morphic.
Berstel, Jean, Séébold, Patrice
openaire +2 more sources