L-systems were developed in 1968 by Aristid Lindenmayer, a Hungarian theoretical biologist and botanist. L-system grammars are very similar to the semi-Thue grammar. Rules of the L- system grammar are applied iteratively starting from the initial state. As many rules as possible are applied simultaneously, per iteration.
About L-system in brief
L-systems were developed in 1968 by Aristid Lindenmayer, a Hungarian theoretical biologist and botanist at the University of Utrecht. L-system grammars are very similar to the semi-Thue grammar. The rules of the L- system grammar are applied iteratively starting from the initial state. As many rules as possible are applied simultaneously, per iteration. If a rule depends not only on a single symbol but also on its neighbours, it is termed a context-sensitive L-System. If there are several, and each is chosen with a certain probability during each iteration, then it is a stochastic L- System. L systems have also been used to model the morphology of a variety of organisms and can be used to generate self-similar fractals. Using L- systems for generating graphical images requires that the symbols in the model refer to elements of a drawing on the computer screen. For example, the program Fractint uses turtle graphics to produce screen images.
Each character of the model is checked through the axiom through which it is fed. In this example, ‘1’ becomes ’11’ in the input string, while ‘O’ remains the same in the output. The result is the sequence of Fibonacci words. The following example shows how this string can be drawn by pushing LIFO and pop to a string. We can see that this string grows in size and complexity and quickly grows in complexity and complexity. This example yields the same result if the rule is replaced with, except that the strings are mirrored. This sequence is a locally catenative sequence because G(n)=G(n+1)(n−1)G( n+2) is the n-th generation. The shape is built by recursively building by the production rules. In the example in the sample above, the string may be given the following: The following instructions: pop to pop and then the string remains in the stack: ‘0’, ‘1’, ‘2’, ‘3’, ‘4’, ‘5’ and ‘6’