Abstract
Recurrence systems have been devised to describe formally certain types of biological developments. A recurrence system specifies a formal language associated with the development of an organism. The family of languages defined by recurrence systems is an extension of some interesting families of languages, including the family of context-free languages. Some normal-form theorems are proved and the equivalence of the family of recurrence languages to a previously studied family of developmental languages (EOL-languages) is shown. Various families of developmental and other formal languages are characterized using recurrence systems. Some closure properties are also discussed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. Blattner, The unsolvability of the equality problem for sentential forms of contextfree languages,J. Computer System Sciences 7 (1973), 463–468.
A. Ehrenfeucht andG. Rozenberg, The equality of EOL languages and codings of OL languages,Internat. J. Computer Math., to appear.
R. W. Floyd, On the nonexistence of a phrase structure grammar for algol 60,Comm. ACM 5 (1962), 483–484.
S. Ginsburg,The Mathematical Theory of Context-Free Languages, McGraw-Hill, New York, 1966.
S. Ginsburg andH. G. Rice, Two families of languages related to algol,J. ACM 9 (1962), 350–371.
G. T. Herman, Closure properties of some families of languages associated with biological systems,Information and Control,24 (1974), 101–121.
G. T. Herman, A biologically motivated extension of algol-like languages,Information and Control 22 (1973), 487–502.
P. Hogeweg andB. Hesper, Pattern recognition in biology: A methodical analysis using computer experimentation,IV Int. Congress Logic, Methodology, Philosophy of Science (1971), Abstract, 279–280.
J. E. Hopcroft andJ. D. Ullman,Formal languages and their Relation to Automata, Addison-Wesley, Reading, Mass., 1969.
E. Konrad-Hawkins, Developmental studies of regenerates ofCallithamnion reseum Harvey,Protoplasma 58 (1964), 42–74.
A. Lindenmayer, Mathematical models for cellular interactions in development, Part I and Part II,Journal of Theoretical Biology 18 (1968), 280–299, 300–315.
A. Lindenmayer, Developmental systems without cellular interactions, their languages and grammars,J. Theoretical Biology 30 (1971), 455–485.
A. Lindenmayer andG. Rozenberg, Developmental systems and languages,Proc. 4th Annual ACM Symp. on Theory of Computing (1972), 214–221.
G. F. Rose, An extension of algol-like languages,Comm. ACM 7 (1964), 52–61.
G. Rozenberg, Direct proofs of the undecidability of the equivalence problem for sentential forms of linear context-free grammars and the equivalence problems for OL-systems,Information Processing Letters 1 (1972), 233–235.
G. Rozenberg,L-systems with interactions,J. Computer System Sciences, to appear.
G. Rozenberg andP. Doucet, On OL-languages,Information and Control 19 (1971), 302–318.
G. Rozenberg andA. Lindenmayer, Developmental systems with locally catenative formulas,Acta Information 2 (1973), 214–248.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Herman, G.T., Lindenmayer, A. & Rozenberg, G. Description of developmental languages using recurrence systems. Math. Systems Theory 8, 316–341 (1974). https://doi.org/10.1007/BF01780579
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01780579