Acta Informatica

, Volume 2, Issue 3, pp 214–248

Developmental systems with locally catenative formulas

  • G. Rozenberg
  • A. Lindenmayer
Article

DOI: 10.1007/BF00289079

Cite this article as:
Rozenberg, G. & Lindenmayer, A. Acta Informatica (1973) 2: 214. doi:10.1007/BF00289079

Summary

A 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.

Copyright information

© Springer-Verlag 1973

Authors and Affiliations

  • G. Rozenberg
    • 1
  • A. Lindenmayer
    • 2
  1. 1.Mathematisch Instituut Rijksuniversiteit te UtrechtUtrechtNederland
  2. 2.Rijksuniversiteit te UtrechtSubfakulteit der Biologie Afdeling Theoretische BiologieUtrechtNederland

Personalised recommendations