<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Jacob, Christian</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Evolving Evolution Programs: Genetic Programming and L-Systems</style></title><secondary-title><style face="normal" font="default" size="100%">GP'96 - First Genetic Programming Conference</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1996</style></year><pub-dates><date><style  face="normal" font="default" size="100%">07/1996</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><pub-location><style face="normal" font="default" size="100%">Stanford, CA, USA</style></pub-location><abstract><style face="normal" font="default" size="100%">&lt;p style=&quot;margin: 0.0px 0.0px 0.0px 0.0px; font: 12.0px Helvetica;&quot;&gt;Parallel rewrite systems in the form of string based L-systems are used for modeling and visualizing growth processes of artificial plants. It is demonstrated how to use evolutionary algorithms for inferring L-systems encoding structures with characteristic properties. We describe our &lt;i&gt;Mathematica &lt;/i&gt;based genetic programming system &lt;i&gt;Evolvica&lt;/i&gt;, present an L-system encoding via expressions, and explain how to generate, modify and breed L-systems through simulated evolution techniques. Extensions of genetic programming operators and expression generation methods strongly relying on templates and pattern matching are shown by example.&lt;/p&gt;</style></abstract></record></records></xml>