Spelling Fibonacci - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2006

Spelling Fibonacci

Abstract

The derivative D of a word is obtained by writing the number of consecutive equal letters when the word is spelled from left to right. For example, D(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 D operator, focusing in particular on the Fibonacci word.
No file

Dates and versions

lirmm-00408112 , version 1 (28-07-2009)

Identifiers

  • HAL Id : lirmm-00408112 , version 1

Cite

Patrice Séébold. Spelling Fibonacci. Workshop on Fibonacci Words, 2006, Turku, Finland. pp.37-40. ⟨lirmm-00408112⟩
85 View
0 Download

Share

Gmail Facebook X LinkedIn More