View in EDS

Inductive inference of lindenmayer systems: algorithms and computational complexity.

Saved in:
Bibliographic Details
Title: Inductive inference of lindenmayer systems: algorithms and computational complexity.
Authors: Duffy, Christopher1 (AUTHOR) christopher.duffy@unimelb.edu.au, Hillis, Sam1 (AUTHOR) sph264@mail.usask.ca, Khan, Umer1 (AUTHOR) umer.khan@usask.ca, McQuillan, Ian2 (AUTHOR) mcquillan@cs.usask.ca, Shan, Sonja Linghui3 (AUTHOR) slshan@uwaterloo.ca
Source: Natural Computing. Sep2025, Vol. 24 Issue 3, p591-601. 11p.
Subject Terms: *COMPUTATIONAL complexity, *NP-complete problems, *PATTERN perception, *PARALLEL processing, *SYNTAX in programming languages, *MACHINE learning, *FORMAL languages
Abstract: 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 learning an L-system from a sequence of strings initially generated by an unknown L-system. This paper studies the computational complexity of inductive inference of a variety of different types of context-free L-systems (deterministic or nondeterministic, tabled or not, and allowing erasing or not). Because this inference is sometimes trivial for nondeterministic L-systems, it is more useful to find the smallest L-system that can generate the sequence of strings, in terms of either the number of rewriting rules, or (when there are tables), the number of tables. For all of the types of L-systems studied, finding an L-system with the smallest number of rewriting rules is NP -complete. However, in all cases, if the number of rewriting rules is fixed, then finding an L-system of any type studied, or finding the smallest L-systems in terms of the number of rewriting rules, or the smallest in terms of the number of tables, can always be done in polynomial time. [ABSTRACT FROM AUTHOR]
Database: Academic Search Index
Description
Abstract: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 learning an L-system from a sequence of strings initially generated by an unknown L-system. This paper studies the computational complexity of inductive inference of a variety of different types of context-free L-systems (deterministic or nondeterministic, tabled or not, and allowing erasing or not). Because this inference is sometimes trivial for nondeterministic L-systems, it is more useful to find the smallest L-system that can generate the sequence of strings, in terms of either the number of rewriting rules, or (when there are tables), the number of tables. For all of the types of L-systems studied, finding an L-system with the smallest number of rewriting rules is NP -complete. However, in all cases, if the number of rewriting rules is fixed, then finding an L-system of any type studied, or finding the smallest L-systems in terms of the number of rewriting rules, or the smallest in terms of the number of tables, can always be done in polynomial time. [ABSTRACT FROM AUTHOR]
ISSN:15677818
DOI:10.1007/s11047-025-10024-x