Using Palindromic Representations to Enumerate the Squares in the Fibonacci Symbolic Process
A square in a string of symbols is a factor (i.e. a subword of adjacent symbols) of the form AA where is AA consists of a word A immediately followed by itself. This is a classical problem in symbolic dynamics, made easier, sometimes, when the the process may be defined by palindromes.