## Currently displaying 1 – 6 of 6

Showing per page

Order by Relevance | Title | Year of publication

### Sturmian morphisms. (Morphismes de Sturm.)

Bulletin of the Belgian Mathematical Society - Simon Stevin

### Complément à l'étude des suites de Thue-Morse généralisées

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

### Look and Say Fibonacci

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

The $LS$ (Look and Say) derivative of a word is obtained by writing the number of consecutive equal letters when the word is spelled from left to right. For example, $LS\left(1\phantom{\rule{0.222222em}{0ex}}1\phantom{\rule{0.222222em}{0ex}}2\phantom{\rule{0.222222em}{0ex}}3\phantom{\rule{0.222222em}{0ex}}3\right)=2\phantom{\rule{0.222222em}{0ex}}1\phantom{\rule{0.222222em}{0ex}}1\phantom{\rule{0.222222em}{0ex}}2\phantom{\rule{0.222222em}{0ex}}2\phantom{\rule{0.222222em}{0ex}}3$ (two $1$, one $2$, two $3$). We start the study of the behaviour of binary words generated by morphisms under the $LS$ operator, focusing in particular on the Fibonacci word.

### Look and Say Fibonacci

RAIRO - Theoretical Informatics and Applications

The () derivative of a word is obtained by writing the number of consecutive equal letters when the word is spelled from left to right. For example, 1 1 2 3 3) = 2 1 1 2 2 3 (two , one , two ). We start the study of the behaviour of binary words generated by morphisms under the operator, focusing in particular on the Fibonacci word.

### Morphismes sturmiens et règles de Rauzy

Journal de théorie des nombres de Bordeaux

Nous donnons une caractérisation complète de tous les morphismes binaires qui préservent les mots sturmiens et montrons que les mots infinis engendrés par ces morphismes sont rigides.

Page 1