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

Celý popis

Podrobná bibliografia

Vydané v:	Natural computing Ročník 24; číslo 3; s. 591 - 601
Hlavní autori:	Duffy, Christopher, Hillis, Sam, Khan, Umer, McQuillan, Ian, Shan, Sonja Linghui
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Dordrecht Springer Nature B.V 01.09.2025
Predmet:	Algorithms Complexity Deep learning Genotype & phenotype Grammars Inference Learning Neural networks Polynomials Self-similarity Simulation Strings
ISSN:	1567-7818, 1572-9796
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!