Space-filling curves and infinite graphs

Two-dimensional geometric patterns in the form of the space filling curves of Peano and Hilbert are represented as a string, an array and a graph. The sequence of patterns is such that each curve is a prefix of the succeeding one and hence we get prefix preserving WDOL to generate the corresponding string representation. The limit language is generable by a CDOL system and consists of a single infinite word corresponding to the Peano curve and two infinite words for the Hilbert curve. The property that in the sequence each curve is a prefix of the succeeding one helps in the definition of the infinite arrays and infinite graphs representing the infinite curve patterns and we construct a Context-free Parentheses Kolam array grammar and a coding of a graph DOL system to generate the sequence as well as the limit.

[1]  A. Lindenmayer,et al.  PARALLEL GRAPH GENERATING AND GRAPH RECURRENCE SYSTEMS FOR MULTICELLULAR DEVELOPMENT , 1976 .

[2]  Grzegorz Rozenberg,et al.  The mathematical theory of L systems , 1980 .

[3]  Joël Quinqueton,et al.  A Locally Adaptive Peano Scanning Algorithm , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  Arto Salomaa,et al.  On Infinite Words Obtained by Iterating Morphisms , 1982, Theor. Comput. Sci..

[5]  Rani Siromoney,et al.  Array Grammars and Kolam , 1974, Comput. Graph. Image Process..