Lindenmayer systems (L-systems) are a grammar system that consists of string rewriting rules. The rules replace every symbol in parallel with successor to produce the next string, and this procedure iterates. In stochastic context-free L-system (S0L-system), may have one or more rule, each an associated probability selection. Properly constructed been found be useful for modeling simulating som...