Results 261 to 270 of about 2,323,275 (283)
Some of the next articles are maybe not open access.
1996
This paper characterizes the development of modular branching structures that satisfy three assumptions: (a) subapical branching, meaning that new branches can be created only near the apices of the existing branches, (b) finite number of module types and states, and (c) absence of interactions between coexisting components of the growing structure ...
Przemyslaw Prusinkiewicz, Lila Kari
openaire +1 more source
This paper characterizes the development of modular branching structures that satisfy three assumptions: (a) subapical branching, meaning that new branches can be created only near the apices of the existing branches, (b) finite number of module types and states, and (c) absence of interactions between coexisting components of the growing structure ...
Przemyslaw Prusinkiewicz, Lila Kari
openaire +1 more source
1994
We present the Genetic L-System Programming (GLP) paradigm for evolutionary creation and development of parallel rewrite systems (L-systems, Lindenmayer-systems) which provide a commonly used formalism to describe developmental processes of natural organisms.
openaire +1 more source
We present the Genetic L-System Programming (GLP) paradigm for evolutionary creation and development of parallel rewrite systems (L-systems, Lindenmayer-systems) which provide a commonly used formalism to describe developmental processes of natural organisms.
openaire +1 more source
2012
An L-system in its simplest form is a variant of a context-free grammar. Originally, L-systems were developed and are still mainly used for modeling plant growth, though with L-systems it is possible to create general fractals, models of towns or even music. However, anyone interested in L-systems and wanting to experiment with them may have difficulty
openaire +2 more sources
An L-system in its simplest form is a variant of a context-free grammar. Originally, L-systems were developed and are still mainly used for modeling plant growth, though with L-systems it is possible to create general fractals, models of towns or even music. However, anyone interested in L-systems and wanting to experiment with them may have difficulty
openaire +2 more sources
1986
Despite of the fact that the complexity theory forms a significant and rapidly growing part of theoretical computer science the study of complexity of L-systems is in its beginnings. In the following three etudes we wish to sketch out some possible directions of such investigations.
openaire +1 more source
Despite of the fact that the complexity theory forms a significant and rapidly growing part of theoretical computer science the study of complexity of L-systems is in its beginnings. In the following three etudes we wish to sketch out some possible directions of such investigations.
openaire +1 more source
L Systems and Nlog — Reductions
1986Jones and Skyum in [J Sk 77], [J Sk 79], and [J Sk 81], as well as, van Leeuwen in [vL] and Sudborough in [Su77] classified the complexities of various problems concerning L systems. This was done by showing these problems, formulated as languages, to be complete for complexity classes like NSPACE(log n), DTIME(Poly), NTIME(Poly), or DSPACE(Poly) with ...
openaire +1 more source