Abstract
This paper presents “forgetful” L systems as a new variant of the classical L systems. In this variant, apart from the state of a cell, its ancestry is also allowed to influence its future development. A cell in a particular state will, depending on its ancestry, remember either all rules or only special marked rules. Such systems are compared with the nonforgetful L systems. Various decidability issues are considered and some closure properties are presented. These systems attempt to provide a more realistic model for modelling certain developmental processes.
This work was done when the second author was at the Department of Computer Science and Engineering, Indian Institute of Technology, Madras 600 036, India
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
G. T. Herman and G. Rozenberg, “Developmental Systems and Languages” North Holland Publishers, Amsterdam, 1975.
J. E. Hopcroft and J. D. Ullman, “Introduction to Automata Theory, Languages and Computation”, Addison Wesley 1979.
W. O. Hollerer and R. Vollmar, On “forgetful” cellular automata, Journal of Computer and System Sciences 11 (1975), 237–251.
Krithivasan, K. and Das, A., Terminal weighted grammars and picture description, Computer Vision, Graphics and Image Processing 30, 1985, pp 534–549.
A. Lindenmayer, Mathematical models for cellular interaction in development: I and II, Journal of Theoretical Biology 18 (1968), 280–315.
Prusinkiewicz, P., Krithivasan K. and Vijayanarayana M. G., Applications of L systems to algorithmic generation of South Indian folk art patterns and Karnatik music, in “A Perspective in Theoretical Computer Science -Commemorative Volume for Gift Siromoney”, ed. R. Narasimhan, World Scientific Publishers, Singapore, 1989, pp 229–247.
Prusinkiewicz, P., Applications of L systems to Computer Imagery, Graph Grammars and their applications to Computer Science, LNCS 291, 1986, pp 534 -549.
G. Rozenberg and A. Salomaa, “The Mathematical Theory of L systems”, Academic Press, New York, 1980.
Salomaa, A., “Formal Languages”, Academic Press Incorporated, 1973.
R. Vollmar, Uber Turingmaschinen mit variablem Speicher, Elektron Informationsverarbeit Kybernetik 9 (1973), 3–13.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Krithivasan, K., Prasad, M.V.N., Mahajan, M. (1992). “Forgetful” L Systems. In: Rozenberg, G., Salomaa, A. (eds) Lindenmayer Systems. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58117-5_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-58117-5_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-63474-1
Online ISBN: 978-3-642-58117-5
eBook Packages: Springer Book Archive