This master’s thesis proposes a method for the evolutionary design of rewriting systems. In particular, genetic algorithm will be applied to design rewriting rules for a specific variant of Lindenmayer system. The evolved rules of such grammar will be applied to generate growing sorting networks. Some distinct approaches to the rewriting process and construction of the sorting networks will be investigated. It will be shown that the evolution is able to successfully design rewriting rules for the proposed variants of rewriting processes. The results obtained exhibit abilities to successfully create partially growing sorting networks, which was evolved to grow for fewer inputs and in subsequent iterations grows up to 36 inputs.
| Identifer | oai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:255380 |
| Date | January 2016 |
| Creators | Nétková, Barbora |
| Contributors | Hyrš, Martin, Bidlo, Michal |
| Publisher | Vysoké učení technické v Brně. Fakulta informačních technologií |
| Source Sets | Czech ETDs |
| Language | Czech |
| Detected Language | English |
| Type | info:eu-repo/semantics/masterThesis |
| Rights | info:eu-repo/semantics/restrictedAccess |
Page generated in 0.0022 seconds