Results 71 to 80 of about 593 (116)
Sturmian words, β-shifts, and transcendence
Theoretical Computer Science, 2004 21 pages ...
Dong Pyo Chi, DoYong Kwon
openaire +2 more sources
Codes of central Sturmian words
Theoretical Computer Science, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
CARPI, Arturo, de Luca A.
openaire +5 more sources
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
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
A new geometric approach to Sturmian words
, 2012 We introduce a new geometric approach to Sturmian words by means of a mapping that associates certain lines in the n×n-grid and sets of finite Sturmian words of length n.
Matomäki, Kaisa, Saari, Kalle
core +1 more source
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
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
Sturmian words with balanced construction
, 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
On the number of factors of Sturmian words
Theoretical Computer Science, 1991 The author presents new results concerning the Sturmian words which were conjectured some years ago. The author gives and proves an exact estimation of the size of \(A_ m\) (the set of factors of length m of all the Sturmian words). He also gives a combinatorial version of the Riemann hypothesis.
openaire +3 more sources