2 citations · 3 across the 2 of their papers we have counts for
3 papers
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.NE2019
Techniques for Inferring Context-Free Lindenmayer Systems With Genetic Algorithm
Jason Bernard, Ian McQuillan
Lindenmayer systems (L-systems) are a formal grammar system, where the most notable feature is a set of rewriting rules that are used to replace every symbol in a string in paralle…
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…