| Issue |
RAIRO-Theor. Inf. Appl.
Volume 45, Number 3, July-September 2011
|
|
|---|---|---|
| Page(s) | 311 - 330 | |
| DOI | https://doi.org/10.1051/ita/2011104 | |
| Published online | 22 August 2011 | |
Locally catenative sequences and Turtle graphics
1
University of Turku, Department of Mathematics, 20014 Turku, Finland
Turku Centre for Computer Science, 20014 Turku, Finland. karhumak@utu.fi
2
Sobolev Institute of Mathematics, Novosibirsk 630090, Russia. svepuz@utu.fi
Received:
11
May
2010
Accepted:
18
March
2011
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.
Mathematics Subject Classification: 68R15
Key words: Combinatorics on words / locally catenative sequences / turtle graphics / Fibonacci word
© EDP Sciences, 2011
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.