Skip to main content
SpringerLink
Log in

Genetic L-System Programming

  • Emergent Computation
  • Conference paper
  • First Online:
Parallel Problem Solving from Nature — PPSN III (PPSN 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 866))

Included in the following conference series:

Abstract

We present the Genetic L-System Programming (GLP) paradigm for evolutionary creation and development of parallel rewrite systems (L-systems, Lindenmayer-systems) which provide a commonly used formalism to describe developmental processes of natural organisms. The L-system paradigm will be extended for the purpose of describing time- and context-dependent formation of formal data structures representing rewrite rules or computer programs (expressions).

With GLP two methods gleaned from nature are combined: simulated evolution and simulated structure formation. A prototypical GLP system implementation is described. Controlled evolution of complex structures is exemplified by the development of tree structures generated by the movement of a 3D-turtle.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Antonisse, H.J., A Grammer-Based Genetic Algorithm, in: G. Rawlins (ed.), Foundations of Genetic Algorithms, San Mateo, 1991.

    Google Scholar 

  2. Jacob, C., Rehder, J., Evolution of neural net architectures by a hierarchical grammar-based genetic system, ICNNGA'93, International Conference on Neural Networks and Genetic Algorithms, Innsbruck, Austria, 1993.

    Google Scholar 

  3. Jacob, C., Typed expressions evolution of artificial nervous systems, to appear in: ICANN'94, International Conference on Artificial Neural Networks, Sorrento, Italy, 1994.

    Google Scholar 

  4. Kinnear, K.E., Advances in Genetic Programming, MIT Press, London, 1994.

    Google Scholar 

  5. Koza, J.R., Genetic Programming, On the Programming of Computers by Means of Natural Selection, MIT Press, London, 1993.

    Google Scholar 

  6. Lindenmayer, A., Rozenberg, G. (eds.), Automata, Languages, Development, North-Holland, 1975.

    Google Scholar 

  7. Lindenmayer, A., Mathematical models for cellular interaction in development, Parts I and II, Journal of Theoretical Biology 18, 1968, pp. 280–315.

    Article  PubMed  Google Scholar 

  8. Peitgen, H.-O., Jürgens, H., Saupe, D., Chaos and Fractals, New Frontiers of Science, Springer-Verlag, 1993, p. 363.

    Google Scholar 

  9. Prusinkiewicz, P., Lindenmayer, A., The Algorithmic Beauty of Plants, Springer-Verlag, 1990, pp. 11ff.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Erlangen-Nürnberg, Martens-Str. 3, D-91058, Erlangen, Germany

    Christian Jacob (Chair of Programming Languages)

Authors
  1. Christian Jacob
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Yuval Davidor Hans-Paul Schwefel Reinhard Männer

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jacob, C. (1994). Genetic L-System Programming. In: Davidor, Y., Schwefel, HP., Männer, R. (eds) Parallel Problem Solving from Nature — PPSN III. PPSN 1994. Lecture Notes in Computer Science, vol 866. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58484-6_277

Download citation

  • DOI: https://doi.org/10.1007/3-540-58484-6_277

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58484-1

  • Online ISBN: 978-3-540-49001-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation