Recall that Fibonacci words are words over the alphabet $\{$a$,$ b$\}$ recursively defined

by

w$0=$ a$,,$ w$1=$ ab$,$ and wn $=$ wn$1$wn$2$ for n $>=2$