Article contents
Locally catenative sequences and Turtle graphics
Published online by Cambridge University Press: 22 August 2011
Abstract
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.
- Type
- Research Article
- Information
- Copyright
- © EDP Sciences, 2011
References
- 1
- Cited by