This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
A. V. Aho andJ. D. Ullman, The theory of languages,Math. Systems Theory 2 (1968), 97–125.
N. Chomsky, Formal properties of grammars,Handbook Math. Psych. 2, pp. 323–418, Wiley, New York, 1963.
M. Davis,Computability and Unsolvability, McGraw-Hill, New York, 1958.
S. Ginsburg,The Mathematical Theory of Context-Free Languages, McGraw-Hill, New York, 1966.
G. T. Herman, The computing ability of a developmental model for filamentous organisms,J. Theoret. Biology 25 (1969), 421.
S. Y. Kuroda, Classes of languages and linear-bounded automata,Information and Control 7 (1964), 207–223.
A. Lindenmayer, Mathematical Models for Cellular Interactions in Development I, II,J. Theoretical Biology 18 (1968), 280–315.
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.
M. L. Minsky,Computation: Finite and Infinite Machines, Prentice Hall, Englewood Cliffs, N.J., 1967.
G. T. Herman, The role of environment in developmental models,J. Theoret Biology 29 (1970), 329–341.
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
- Computational Mathematic