Results 51 to 60 of about 359 (107)
Combinatorial structure of Sturmian words and continued fraction expansions of Sturmian numbers [PDF]
, 2023 International audienceLet θ = [0; a 1 , a 2 ,. . .] be the continued fraction expansion of an irrational real number θ ∈ (0, 1). It is well-known that the characteristic Sturmian word of slope θ is the limit of a sequence of finite words (M k) k≥0 , with
Bugeaud, Yann, Laurent, Michel
core +1 more source
A Characterization of Sturmian Words by Return Words
European Journal of Combinatorics, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Generalized balances in Sturmian words
Discrete Applied Mathematics, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fagnot, Isabelle, Vuillon, Laurent
openaire +2 more sources
Directive words of episturmian words: equivalences and normalization
, 2008 Episturmian morphisms constitute a powerful tool to study episturmian words. Indeed, any episturmian word can be infinitely decomposed over the set of pure episturmian morphisms.
Amy Glen +8 more
core +1 more source
Quasiperiods of biinfinite Sturmian words
CoRR, 2018 We study the notion of quasiperiodicity, in the sense of "coverability", for biinfinite words. All previous work about quasiperiodicity focused on right infinite words, but the passage to the biinfinite case could help to prove stronger results about quasiperiods of Sturmian words.
Florian Barbero +2 more
openaire +2 more sources
, 2006 In this paper we define Sturmian graphs and we prove that all of them have a certain ''''counting'''' property. We show deep connections between this counting property and two conjectures, by Moser and by Zaremba, on the continued fraction expansion of ...
Shallit, Jeffrey +9 more
core +1 more source
The sequence of open and closed prefixes of a Sturmian word.
, 2017 International audienceA finite word is closed if it contains a factor that occurs both as a prefix and as a suffix but does not have internal occurrences, otherwise it is open.
de Luca, Alessandro, Zamboni, Luca Q.
core +2 more sources
The Number of Runs in Sturmian Words [PDF]
, 2008 Denote by the class of standard Sturmianwords. It is a class of highly compressible words extensively studied in combinatorics of words, including the well known Fibonacci words. The suffix automata for these words have a very particular structure.
Pawel Baturo +2 more
openaire +1 more source
Words and morphisms with Sturmian erasures
, 2004 International audienceWe say $x \in \{ 0,1,2 \}^{\NN}$ is a word with Sturmian erasures if for any $a\in \{ 0,1,2 \}$ the word obtained erasing all $a$ in $x$ is a Sturmian word.
Guerziz, Adel +2 more
core +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