10 citations · 13 across the 3 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2020★ 1 cited
Stochastic L-system Inference from Multiple String Sequence Inputs
Jason Bernard, Ian McQuillan
Lindenmayer systems (L-systems) are a grammar system that consist of string rewriting rules. The rules replace every symbol in a string in parallel with a successor to produce the…
cs.AI2017★ 2 cited
New Techniques for Inferring L-Systems Using Genetic Algorithm
Jason Bernard, Ian McQuillan
Lindenmayer systems (L-systems) are a formal grammar system that iteratively rewrites all symbols of a string, in parallel. When visualized with a graphical interpretation, the ima…