4 citations · 8 across the 6 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
cs.FL2019★ 3 cited
A model for a Lindenmayer reconstruction algorithm
Diego Gabriel Krivochen, Beth Phillips
Given an input string s and a specific Lindenmayer system (the so-called Fibonacci grammar), we define an automaton which is capable of (i) determining whether s belongs to the set…
cs.FL2018★ 4 cited
Towards a classification of Lindenmayer systems
Diego Krivochen, Douglas Saddy
In this paper we will attempt to classify Lindenmayer systems based on properties of sets of rules and the kind of strings those rules generate. This classification will be referre…