TCS
2002
13 years 11 months ago
2002
We show that the coding of a rotation by on m intervals can be recoded over m Sturmian words of angle . c 2002 Elsevier Science B.V. All rights reserved.
DAM
2007
13 years 11 months ago
2007
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 conj...
CORR
2008
Springer
13 years 11 months ago
2008
Springer
In this paper we explore various interconnections between rich words, Sturmian words, and trapezoidal words. Rich words, first introduced by the second and third authors together w...
STRINGOLOGY
2008
14 years 26 days ago
2008
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...