Techniques for Inferring Context-Free Lindenmayer Systems With Genetic Algorithm

Lindenmayer systems (L-systems) are a formal grammar system, where the most notable feature is a set of rewriting rules that are used to replace every symbol in a string in parallel; by repeating this process, a sequence of strings is produced. Some symbols in the strings may be interpreted as instr...

Full description

Bibliographic Details

Published in:	arXiv.org
Main Authors:	Bernard, Jason, McQuillan, Ian
Format:	Paper
Language:	English
Published:	Ithaca Cornell University Library, arXiv.org 29.04.2021
Subjects:	Computer simulation Genetic algorithms Inference Strings Symbols
ISSN:	2331-8422
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!