A survey on L-system Inference
Autor(a) principal: | |
---|---|
Data de Publicação: | 2009 |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | INFOCOMP: Jornal de Ciência da Computação |
Texto Completo: | https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/268 |
Resumo: | Many algorithms of grammatical inference were developed for several types of grammars. The grammatical inference problem consists of finding, from a set of strings, a grammar that produces all the strings of this set [3]. 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 [15]. 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 field. |
id |
UFLA-5_b395b7abf77e565a360b833e6db2fc7d |
---|---|
oai_identifier_str |
oai:infocomp.dcc.ufla.br:article/268 |
network_acronym_str |
UFLA-5 |
network_name_str |
INFOCOMP: Jornal de Ciência da Computação |
repository_id_str |
|
spelling |
A survey on L-system InferenceL-systemgrammatical inferencetree structurepositiv e sample.Many algorithms of grammatical inference were developed for several types of grammars. The grammatical inference problem consists of finding, from a set of strings, a grammar that produces all the strings of this set [3]. 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 [15]. 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 field.Editora da UFLA2009-09-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdfhttps://infocomp.dcc.ufla.br/index.php/infocomp/article/view/268INFOCOMP Journal of Computer Science; Vol. 8 No. 3 (2009): September, 2009; 29-391982-33631807-4545reponame:INFOCOMP: Jornal de Ciência da Computaçãoinstname:Universidade Federal de Lavras (UFLA)instacron:UFLAenghttps://infocomp.dcc.ufla.br/index.php/infocomp/article/view/268/253Copyright (c) 2016 INFOCOMP Journal of Computer Scienceinfo:eu-repo/semantics/openAccessBen-Naoum, Farah2015-07-22T18:07:57Zoai:infocomp.dcc.ufla.br:article/268Revistahttps://infocomp.dcc.ufla.br/index.php/infocompPUBhttps://infocomp.dcc.ufla.br/index.php/infocomp/oaiinfocomp@dcc.ufla.br||apfreire@dcc.ufla.br1982-33631807-4545opendoar:2024-05-21T19:54:28.601495INFOCOMP: Jornal de Ciência da Computação - Universidade Federal de Lavras (UFLA)true |
dc.title.none.fl_str_mv |
A survey on L-system Inference |
title |
A survey on L-system Inference |
spellingShingle |
A survey on L-system Inference Ben-Naoum, Farah L-system grammatical inference tree structure positiv e sample. |
title_short |
A survey on L-system Inference |
title_full |
A survey on L-system Inference |
title_fullStr |
A survey on L-system Inference |
title_full_unstemmed |
A survey on L-system Inference |
title_sort |
A survey on L-system Inference |
author |
Ben-Naoum, Farah |
author_facet |
Ben-Naoum, Farah |
author_role |
author |
dc.contributor.author.fl_str_mv |
Ben-Naoum, Farah |
dc.subject.por.fl_str_mv |
L-system grammatical inference tree structure positiv e sample. |
topic |
L-system grammatical inference tree structure positiv e sample. |
description |
Many algorithms of grammatical inference were developed for several types of grammars. The grammatical inference problem consists of finding, from a set of strings, a grammar that produces all the strings of this set [3]. 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 [15]. 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 field. |
publishDate |
2009 |
dc.date.none.fl_str_mv |
2009-09-01 |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/268 |
url |
https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/268 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/268/253 |
dc.rights.driver.fl_str_mv |
Copyright (c) 2016 INFOCOMP Journal of Computer Science info:eu-repo/semantics/openAccess |
rights_invalid_str_mv |
Copyright (c) 2016 INFOCOMP Journal of Computer Science |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.none.fl_str_mv |
Editora da UFLA |
publisher.none.fl_str_mv |
Editora da UFLA |
dc.source.none.fl_str_mv |
INFOCOMP Journal of Computer Science; Vol. 8 No. 3 (2009): September, 2009; 29-39 1982-3363 1807-4545 reponame:INFOCOMP: Jornal de Ciência da Computação instname:Universidade Federal de Lavras (UFLA) instacron:UFLA |
instname_str |
Universidade Federal de Lavras (UFLA) |
instacron_str |
UFLA |
institution |
UFLA |
reponame_str |
INFOCOMP: Jornal de Ciência da Computação |
collection |
INFOCOMP: Jornal de Ciência da Computação |
repository.name.fl_str_mv |
INFOCOMP: Jornal de Ciência da Computação - Universidade Federal de Lavras (UFLA) |
repository.mail.fl_str_mv |
infocomp@dcc.ufla.br||apfreire@dcc.ufla.br |
_version_ |
1799874740892991488 |