LOCALLY CATENATIVE SEQUENCES AND TURTLE GRAPHICS
Motivated by striking properties of the well known Fibonacci word we consider pictures which are defined by this word and its variants via so-called turtle graphics. Such a picture can be bounded or unbounded. We characterize when the picture defined by not only the Fibonacci recurrence, but also by a general recurrence formula, is bounded, the characterization being computable.
locally catenative sequences turtle graphics fibonacci word combinatorics on words