Sciweavers

28 search results - page 4 / 6
» Sturmian and Episturmian Words
Sort
View
50
Voted
CORR
2010
Springer
63views Education» more  CORR 2010»
14 years 9 months ago
Bifix codes and Sturmian words
Jean Berstel, Clelia de Felice, Dominique Perrin, ...
TCS
2002
14 years 11 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
78
Voted
ITA
2008
123views Communications» more  ITA 2008»
14 years 11 months ago
On some problems related to palindrome closure
In this paper we solve some open problems related to (pseudo)palindrome closure operators and to the infinite words generated by their iteration, that is, standard episturmian and...
Michelangelo Bucci, Aldo de Luca, Alessandro De Lu...
CORR
2006
Springer
131views Education» more  CORR 2006»
14 years 11 months ago
Sequences with constant number of return words
An infinite word has the property Rm if every factor has exactly m return words. Vuillon showed that R2 characterizes Sturmian words. We prove that a word satisfies Rm if its compl...
Lubomíra Balková, Edita Pelantov&aac...
97
Voted
STRINGOLOGY
2008
15 years 1 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