Results 61 to 70 of about 359 (107)
Sturmian words and the Stern sequence
Theoretical Computer Science, 2015 Central, standard, and Christoffel words are three strongly interrelated classes of binary finite words which represent a finite counterpart of characteristic Sturmian words. A natural arithmetization of the theory is obtained by representing central and Christoffel words by irreducible fractions labeling respectively two binary trees, the Raney (or ...
DE LUCA, ALDO, DE LUCA, ALESSANDRO
openaire +4 more sources
Sturmian numeration systems and decompositions to palindromes
, 2018 International audienceWe extend classical Ostrowski numeration systems, closely related to Sturmian words, by allowing a wider range of coefficients, so that possible representations of a number n better reflect the structure of the associated ...
Frid, Anna, E. +2 more
core +1 more source
Fibonacci morphisms and Sturmian words
Theoretical Computer Science, 1991 The paper solves four problems on binary morphisms proposed by \textit{M. Kósa} [Bull. EATCS 32, 331-333 (1987)].
openaire +2 more sources
On Infinite Prefix Normal Words. [PDF]
Theor Comput Sci, 2021 Cicalese F, Lipták Z, Rossi M.
europepmc +1 more source
Modified complexity and $*$-Sturmian word
Proceedings of the Japan Academy, Series A, Mathematical Sciences, 1999 The authors introduce a new notion of complexity \(p^*\) for an infinite sequence over a finite alphabet. Instead of counting all the factors (blocks) of given length occurring in the sequence, they count all the blocks of given length that occur infinitely often in the sequence. Accordingly they define *-Sturmian words.
Nakashima, Izumi +2 more
openaire +3 more sources
Open and Closed Prefixes of Sturmian Words
, 2013 A word is closed if it contains a proper factor that occurs both as a prefix and as a suffix but does not have internal occurrences, otherwise it is open.
Alessandro De Luca +4 more
core +1 more source
Order and quasiperiodicity in episturmian words
, 2007 We prove a refinement of a recent characterization of infinite episturmian words via lexicographic orderings (Glen-Justin-Pirillo, 2007). This allows us to easily characterize the strict episturmian words that are "infinite Lyndon words", i.e., those ...
Glen, A.
core
Studies on finite Sturmian words
Theoretical Computer Science, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
, 2008 06.03.2018 tarihli ve 30352 sayılı Resmi Gazetede yayımlanan “Yükseköğretim Kanunu İle Bazı Kanun Ve Kanun Hükmünde Kararnamelerde Değişiklik Yapılması Hakkında Kanun” ile 18.06.2018 tarihli “Lisansüstü Tezlerin Elektronik Ortamda Toplanması ...
Kaçmaz, Şerife
core
Test-words for Sturmian morphisms
, 1999 International audienceJ. Berstel and P. Séébold have proved that an acyclic morphism f is Sturmian iff the word f(baabaababaabab) is balanced. More precisely, they have given a set \Omega of test-words for Sturmian morphisms.
Richomme, Gwenaël
core +1 more source