Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-17T14:49:48.186Z Has data issue: false hasContentIssue false

Look and Say Fibonacci

Published online by Cambridge University Press:  04 January 2008

Patrice Séébold*
Affiliation:
LIRMM, Univ. Montpellier 2, CNRS - 161 rue Ada, 34392 Montpellier, France; Patrice.Seebold@lirmm.frDépartement Mathématiques et Informatique Appliquées - UFR4, Université Paul Valéry, Route de Mende, 34199 Montpellier, France.
Get access

Abstract

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( 1 1 2 3 3) = 2 1 1 2 2 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.

Information

Type
Research Article
Copyright
© EDP Sciences, 2008

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable