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...

Full description

Bibliographic Details

Published in:	Natural computing Vol. 24; no. 3; pp. 591 - 601
Main Authors:	Duffy, Christopher, Hillis, Sam, Khan, Umer, McQuillan, Ian, Shan, Sonja Linghui
Format:	Journal Article
Language:	English
Published:	Dordrecht Springer Nature B.V 01.09.2025
Subjects:	Algorithms Complexity Deep learning Genotype & phenotype Grammars Inference Learning Neural networks Polynomials Self-similarity Simulation Strings
ISSN:	1567-7818, 1572-9796
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!