L-systems and artificial chemistry to develop digital organisms

2011 ◽  
Author(s):  
Nedjma Djezzar ◽  
Noureddine Djedi ◽  
Sylvain Cussat-Blanc ◽  
Herve Luga ◽  
Yves Duthen
Keyword(s):  
Artificial Chemistry ◽  
Digital Organisms ◽  
L Systems

Optimal Land Use Analysis Using Lindenmayer Grammars

2013 ◽  
Vol 8 (2) ◽  
pp. 163-175
Author(s):  
Urszula Żukowska ◽  
Grażyna Kalewska
Keyword(s):  
Land Use ◽  
Urban Development ◽  
Computer Program ◽  
L System ◽  
L Systems ◽  
The City

In today's world, when it is so important to use every piece of land for a particular purpose, both economically and ecologically, identifying optimal land use is a key issue. For this reason, an analysis of the optimal land use in a section of the city of Olsztyn, using the L-system Urban Development computer program, was chosen as the aim of this paper. The program uses the theories of L-systems and the cartographic method to obtain results in the form of sequences of productions or maps. For this reason, the first chapters outline both theories, i.e. the cartographic method to identify optimal land use and Lindenmayer grammars (called L-systems). An analysis based on a fragment of the map of Olsztyn was then carried out. Two functions were selected for the analysis: agricultural and forest-industrial. The results are presented as maps and sequences in individual steps.

Artificial Chemistry and Molecular Darwinian Evolution in silico

2003 ◽  
Vol 68 (1) ◽  
pp. 139-177 ◽  
Author(s):  
Vladimír Kvasnička ◽  
Jiří Pospíchal
Keyword(s):  
Graph Theory ◽  
Molecular Level ◽  
Stable State ◽  
Chemical Reactor ◽  
Darwinian Evolution ◽  
Simplified Model ◽  
Asymptotically Stable ◽  
Artificial Chemistry ◽  
Neutral Mutations ◽  
Binary Strings

A simplified model of Darwinian evolution at the molecular level is studied by applying the methods of artificial chemistry. A chemical reactor (chemostat) contains molecules that are represented by binary strings, the strings being capable of replication with a probability proportional to their fitness. Moreover, the process of replication is not fully precise, sporadic mutations may produce new offspring strings, which are slightly different from their parent templates. The dynamics of such an autoreplicating system is described by Eigen's differential equations. These equations have a unique asymptotically stable state, which corresponds to those strings that have the highest rate constants (fitness). Fitness of binary string is calculated as a graph-theory similarity between a folding (phenotype) of respective string and the so-called required folding. The presented method offers a detailed view of mechanisms of the molecular Darwinian evolution, in particular of the meaning and importance of neutral mutations.

On metalinear ETOL systems

1980 ◽  
Vol 3 (1) ◽  
pp. 15-36
Author(s):  
Grzegorz Rozenberg ◽  
Dirk Vermeir
Keyword(s):  
Finite Index ◽  
Closure Properties ◽  
Pumping Lemma ◽  
L Systems ◽  
Structural Characterizations

The concept of metalinearity in ETOL systems is investigated. Some structural characterizations, a pumping lemma and the closure properties of the resulting class of languages are established. Finally, some applications in the theory of L systems of finite index are provided.

Information Retrieval Systems, an Algebraic Approach I1

1981 ◽  
Vol 4 (3) ◽  
pp. 551-603
Author(s):  
Zbigniew Raś
Keyword(s):  
Information Retrieval ◽  
Boolean Algebra ◽  
Partially Ordered Set ◽  
Ordered Set ◽  
Algebraic Approach ◽  
Partially Ordered ◽  
Retrieval Systems ◽  
Information Retrieval Systems ◽  
Present Part ◽  
L Systems

This paper is the first of the three parts of work on the information retrieval systems proposed by Salton (see [24]). The system is defined by the notions of a partially ordered set of requests (A, ⩽), the set of objects X and a monotonic retrieval function U : A → 2X. Different conditions imposed on the set A and a function U make it possible to obtain various classes of information retrieval systems. We will investigate systems in which (A, ⩽) is a partially ordered set, a lattice, a pseudo-Boolean algebra and Boolean algebra. In my paper these systems are called partially ordered information retrieval systems (po-systems) lattice information retrieval systems (l-systems); pseudo-Boolean information retrieval systems (pB-systems) and Boolean information retrieval systems (B-systems). The first part concerns po-systems and 1-systems. The second part deals with pB-systems and B-systems. In the third part, systems with a partial access are investigated. The present part discusses the method for construction of a set of attributes. Problems connected with the selectivity and minimalization of a set of attributes are investigated. The characterization and the properties of a set of attributes are given.

Application of L-systems to geometrical construction of chamise and juniper shrubs

2014 ◽  
Vol 273 ◽  
pp. 86-95 ◽  
Author(s):  
Dallan R. Prince ◽  
Marianne E. Fletcher ◽  
Chen Shen ◽  
Thomas H. Fletcher
Keyword(s):  
Geometrical Construction ◽  
L Systems

ET0L SYSTEMS FOR COMPOSITE DODECAGONAL QUASICRYSTAL PATTERNS

2001 ◽  
Vol 15 (08) ◽  
pp. 1165-1175 ◽  
Author(s):  
JUAN GARCÍA ESCUDERO
Keyword(s):  
Pisot Number ◽  
Substitution Tilings ◽  
Inflation Factor ◽  
L Systems ◽  
Inflation Rules

Two types of deterministic substitution tilings with 12-fold symmetry and a Pisot number as inflation factor are generated and described in terms of bracketed L-systems. Composition of the inflation rules allows to construct other types of dodecagonal patterns which can be described with the help of ET0L-systems and may be used in order to derive nondeterministic models of quasicrystal structures.

Sign in / Sign up

Export Citation Format

Share Document