Inductive inference of Lindenmayer systems: algorithms and computational complexity

Lindenmayer systems (L-systems) are string rewriting systems that can model and be used to create simulations of processes with inherent parallelism and self-similarity. Inference of L-systems involves the automated learning of these models/grammars from data; and inductive inference involves learni...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Natural computing Jg. 24; H. 3; S. 591 - 601
Hauptverfasser:	Duffy, Christopher, Hillis, Sam, Khan, Umer, McQuillan, Ian, Shan, Sonja Linghui
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Dordrecht Springer Nature B.V 01.09.2025
Schlagworte:	Algorithms Complexity Deep learning Genotype & phenotype Grammars Inference Learning Neural networks Polynomials Self-similarity Simulation Strings
ISSN:	1567-7818, 1572-9796
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!