Berstel, Jean Fibonacci words - a survey. (English) Zbl 0589.68053 The book of L, dedic. A. Lindenmayer Occas. 60th Birthday, 13-27 (1986). [For the entire collection see Zbl 0575.00023.] The sequence of Fibonacci words in \(\{a,b\}^*\) is defined by \(f_ 0=a\), \(f_ 1=ab\), and \(f_{n+2}=f_{n+1}f_ n\) for \(n\geq 0\). This beautiful survey presents a number of combinatorial properties in relation to the subwords of Fibonacci words as well as basic arithmetic operations in the Fibonacci number system. Reviewer: P.Kirschenhofer Cited in 26 Documents MSC: 68Q45 Formal languages and automata 11A63 Radix representation; digital problems 11B37 Recurrences Keywords:Fibonacci number system Citations:Zbl 0575.00023 PDF BibTeX XML Online Encyclopedia of Integer Sequences: The infinite Fibonacci word: start with 1, repeatedly apply the morphism 1->12, 2->1, take limit; or, start with S(0)=2, S(1)=1, and for n>1 define S(n)=S(n-1)S(n-2), then the sequence is S(oo).