Sciweavers

Share
TCS
2002
8 years 3 months ago
Coding rotations on intervals
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.
Jean Berstel, Laurent Vuillon
DAM
2007
97views more  DAM 2007»
8 years 3 months ago
On Sturmian graphs
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...
Chiara Epifanio, Filippo Mignosi, Jeffrey Shallit,...
CORR
2008
Springer
61views Education» more  CORR 2008»
8 years 3 months ago
Rich, Sturmian, and trapezoidal words
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...
Aldo de Luca, Amy Glen, Luca Q. Zamboni
STRINGOLOGY
2008
8 years 4 months ago
Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian Words
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...
Pawel Baturo, Marcin Piatkowski, Wojciech Rytter
books