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.

[1]  M. Lothaire,et al.  Algebraic Combinatorics on Words: Index of Notation , 2002 .

[2]  Julien Cassaigne.  On extremal properties of the Fibonacci word , 2008, RAIRO Theor. Informatics Appl..

[3]  Tero Harju,et al.  Combinatorics on Words , 2004 .

[4]  Nivat G. Päun,et al.  Handbook of Formal Languages , 2013, Springer Berlin Heidelberg.

[5]  L. Mirsky,et al.  The Theory of Matrices , 1961, The Mathematical Gazette.

[6]  Michael F. Barnsley,et al.  Fractals everywhere , 1988 .

[7]  Seymour Papert,et al.  Mindstorms: Children, Computers, and Powerful Ideas , 1981 .

[8]  Peter Lancaster,et al.  The theory of matrices , 1969 .

[9]  J. Allouche.  Algebraic Combinatorics on Words , 2005 .

[10]  Jean-Paul Allouche,et al.  Kolam indiens, dessins sur le sable aux îles Vanuatu, courbe de Sierpinski et morphismes de monoïde , 2006 .

[11]  Christian Choffrut,et al.  Combinatorics of Words , 1997, Handbook of Formal Languages.

[12]  F. R. Gantmakher.  The Theory of Matrices , 1984 .

[13]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[14]  Grzegorz Rozenberg,et al.  Handbook of Formal Languages , 1997, Springer Berlin Heidelberg.

[15]  M. Lothaire,et al.  Applied Combinatorics on Words , 2005 .

[16]  J. Shallit,et al.  Wire bending , 1989, J. Comb. Theory, Ser. A.

[17]  Glen Bull,et al.  Children, Computers, and Powerful Ideas. , 2005 .

[18]  F. Michel Dekking,et al.  Replicating Superfigures and Endomorphisms of Free Groups , 1982, J. Comb. Theory, Ser. A.

[19]  Umberto Eco,et al.  Theory of Codes , 1976 .

[20]  Toufik Mansour,et al.  Generating the Peano Curve and Counting Occurrences of some Patterns , 2004, J. Autom. Lang. Comb..

[21]  Grzegorz Rozenberg,et al.  L Systems , 1974, Handbook of Formal Languages.

[22]  Christian Choffrut.  Iterated Substitutions and Locally Catanative Systems: A Decidability Result in the Binary Case , 1990, ICALP.

[23]  M. Lothaire.  Combinatorics on words: Bibliography , 1997 .

[24]  Jeffrey Shallit.  A Generalization of Automatic Sequences , 1988, Theor. Comput. Sci..