Results 71 to 80 of about 1,318,046 (112)

Fibonacci morphisms and Sturmian words

open access: yesTheoretical Computer Science, 1991
The paper solves four problems on binary morphisms proposed by \textit{M. Kósa} [Bull. EATCS 32, 331-333 (1987)].
openaire   +3 more sources

A new geometric approach to Sturmian words [PDF]

open access: yes, 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 the number of factors of Sturmian words

open access: yesTheoretical 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

On a combinatorial property of Sturmian words

open access: yesTheoretical Computer Science, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jacques Justin, Giuseppe Pirillo
openaire   +3 more sources

Lyndon words and singular factors of Sturmian words

open access: yesTheoretical Computer Science, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +4 more sources

Sturmian and dendric words

open access: yes, 2023
This poster is a quick introduction to Sturmian words and to dendric words, one of their generalization.
Gheeraert, France
core  

Language Structure of Pattern Sturmian Words

open access: yes, 2008
Pattern Sturmian words introduced by Kamae and Zamboni [KZ1, KZ2] are an analogy of Sturmian words for the maximal pattern complexity instead of the block complexity. So far, two kinds of recurrent pattern Sturmian words are known, namely, rotation words
Hui Rao   +3 more
core  

Home - About - Disclaimer - Privacy