RI UFLA (Universidade Federal de Lavras) >
Revistas UFLA >
Please use this identifier to cite or link to this item:
|Title: ||A survey on L-system inference|
|???metadata.dc.creator???: ||Ben-Naoum, Farah|
Estrutura de árvore
|Publisher: ||Editora da UFLA|
|Citation: ||BEN-NAOUM, F. A survey on L-system inference. INFOCOMP: Journal of Computer Science, Lavras, v. 8, n. 3, p. 29-39, Sept. 2009.|
|Abstract: ||Many algorithms of grammatical inference were developed for several types of grammars. The grammatical inference problem consists of ﬁnding, from a set of strings, a grammar that produces all the strings of this set . We are interested here by the inference of particular grammars, noted Lsystems, which are parallel rewriting systems most famously used to model the growth processes of plant development. We present a survey on methods of L-system inference proposed since the creation of this rewriting system by Aristid Lindenmayer in 1968 . The grammatical inference of L-systems has been studied over the past 30 years, and that in relation to several areas of application of produced L-systems. We are interested in looking at this problem from the point of view of a possible use of these methods for an application in biological modeling, particularly in the modeling of plants. In order to provide a better understanding of the research challenges of L-system inference, this article presents a detailed investigation of current state-of-the-art algorithms in L-system inference, with an analysis highlighting their positive and negative points. Open research issues are also discussed, with an objective to spark new research interests in this ﬁeld.|
|Other Identifiers: ||http://www.dcc.ufla.br/infocomp/index.php/INFOCOMP/article/view/268|
|Appears in Collections:||Infocomp|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.