A classification of periodic turtle sequences

J. Holdener and A. Wagaman

International Journal of Mathematics and Mathematical Sciences, 2003, vol. 2003, 1-9

Abstract:

A turtle sequence is a word constructed from an alphabet of two letters: F , which represents the forward motion of a turtle in the plane, and L , which represents a counterclockwise turn. In this paper, we investigate such sequences and establish links between the combinatoric properties of words and the geometric properties of the curves they generate. In particular, we classify periodic turtle sequences in terms of their closure (or lack thereof).

Date: 2003
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/2003/710958.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/2003/710958.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:710958

DOI: 10.1155/S0161171203209078

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().