Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

A note on some systems of lindenmayer

  • 53 Accesses

  • 31 Citations

This is a preview of subscription content, log in to check access.

References

  1. [1]

    A. V. Aho andJ. D. Ullman, The theory of languages,Math. Systems Theory 2 (1968), 97–125.

  2. [2]

    N. Chomsky, Formal properties of grammars,Handbook Math. Psych. 2, pp. 323–418, Wiley, New York, 1963.

  3. [3]

    M. Davis,Computability and Unsolvability, McGraw-Hill, New York, 1958.

  4. [4]

    S. Ginsburg,The Mathematical Theory of Context-Free Languages, McGraw-Hill, New York, 1966.

  5. [5]

    G. T. Herman, The computing ability of a developmental model for filamentous organisms,J. Theoret. Biology 25 (1969), 421.

  6. [6]

    S. Y. Kuroda, Classes of languages and linear-bounded automata,Information and Control 7 (1964), 207–223.

  7. [7]

    A. Lindenmayer, Mathematical Models for Cellular Interactions in Development I, II,J. Theoretical Biology 18 (1968), 280–315.

  8. [8]

    M. L. Minsky, Recursive unsolvability of Post's problem of tag and other topics in the theory of Turing machines,Ann. Math. 74 (1961), 437–455.

  9. [9]

    M. L. Minsky,Computation: Finite and Infinite Machines, Prentice Hall, Englewood Cliffs, N.J., 1967.

  10. [10]

    G. T. Herman, The role of environment in developmental models,J. Theoret Biology 29 (1970), 329–341.

Download references

Author information

Rights and permissions

Reprints and Permissions

About this article

Cite this article

van Dalen, D. A note on some systems of lindenmayer. Math. Systems Theory 5, 128–140 (1971). https://doi.org/10.1007/BF01702868

Download citation

Keywords

  • Computational Mathematic