Developmental systems with locally catenative formulas

SummaryA locally catenative sequence of strings of letters is such that each string in the sequence, after an initial stretch, is formed by concatenating strings which occurred at some specified distances previously in the sequence. These kinds of structures are frequently encountered in biological development, particularly in the case of compound branching structures or compound leaves. Developmental systems have been formally defined in previous publications. One of the present results is that dependent PDOL systems can produce sequences for every locally catenative formula (PDOL systems are propagating, deterministic developmental systems without interactions). Every dependent PDOL system produces a sequence which satisfies an infinite class of locally catenative formulas. Some of these formulas can be derived from a minimum formula, but a sequence may satisfy more than one minimum formulas.

[1]  Gabor T. Herman,et al.  Closure Properties of Some Families of Languages Associated with Biological Systems , 1974, Inf. Control..

[2]  Gabor T. Herman,et al.  Simulation of organisms using a developmental model part 1: Basic description , 1972 .

[3]  Dirk van Dalen.  A note on some systems of lindenmayer , 2005, Mathematical systems theory.

[4]  G. Mitchison,et al.  Rule governing Cell Division in Anabaena , 1972, Nature.

[5]  G. V. Iterson.  Mathematische und mikroskopisch-anatomische Studien über Blattstellungen: nebst Betrachtungen über den Schalenbau der Miliolinen , 1907 .

[6]  G. Herman.  Computing ability of a developmental model for filamentous organisms. , 1969, Journal of theoretical biology.

[7]  G. Herman.  Role of environment in developmental models. , 1970, Journal of theoretical biology.

[8]  Jeffrey D. Ullman,et al.  Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.

[9]  Grzegorz Rozenberg,et al.  On 0L-Languages , 1971, Inf. Control..

[10]  Gabor T. Herman,et al.  Algorithms for Producing Grammars from Sample Derivations: A Common Problem of Formal Language Theory and Developmental Biology , 1973, J. Comput. Syst. Sci..

[11]  P. Doucet.  On the membership question in some Lindenmayer-systems , 1972 .

[12]  A. Lindenmayer.  Mathematical models for cellular interactions in development. II. Simple and branching filaments with two-sided inputs. , 1968, Journal of theoretical biology.

[13]  G. Herman.  I. General description and the problem of universal computing ability , 1971 .

[14]  A. Lindenmayer.  Mathematical models for cellular interactions in development. I. Filaments with one-sided inputs. , 1968, Journal of theoretical biology.

[15]  Aristid Lindenmayer,et al.  Mathematical Models for Cellular Interactions in Development , 1968 .

[16]  A. Lindenmayer.  Developmental systems without cellular interactions, their languages and grammars. , 1971, Journal of theoretical biology.