Using L-Systems as Graph Grammar: G2L-Systems
Egbert J. W. Boers · 2015
This paper will show how the interpretation of strings resulting from L-systems can be adapted in such a way that L-systems can be used as graph grammars. One of the advantages of this adaptation is the possibility to make use of the context dependency available in L-systems. This context is calculated by using the graph interpretation of the strings at each successive step of the rewriting mechanism. The modifications to L-systems necessary in order to use them as graph grammars will be explained. A simple proof will be given that every possible directed graph can be generated using this representation. At the end of the paper an application of this G2L-system based graph grammar will be presented. In this application a genetic algorithm optimizes the rewriting rules of an G2L-system, trying to come to a more scalable method for finding good artificial neural network architectures in comparison with methods that do not use graph grammars. The presented G2L-system was specifically desi...