Borders Of Fibonacci Strings

Abstract

We determine all borders of the $n\underset{\_}{th}$ Fibonacci string, $f_n$, for $n\ge 3$. In particular, we give two proofs that the longest border of $f_n$ is $f_{n-2}$. One proof is independent of the Defect Theorem.