Lindenmayer Systems: Impacts on Theoretical Computer Science, Computer Graphics, and Developmental Biology

Couverture
Grzegorz Rozenberg, Arto Salomaa
Springer Science & Business Media, 6 déc. 2012 - 514 pages
0 Avis
Les avis ne sont pas validés, mais Google recherche et supprime les faux contenus lorsqu'ils sont identifiés
L systems are language-theoretic models for developmental biology. They wereintroduced in 1968 by Aristid Lindenmayer (1925-1989) and have proved to be among the most beautiful examples of interdisciplinary science, where work in one area induces fruitful ideas and results in other areas. L systemsare based on relational and set-theoretic concepts, which are more suitable for the discrete and combinatorial structures of biology than mathematical models based on calculus or statistics. L systems have stimulated new work not only in the realistic simulation of developing organisms but also in the theory of automata and formal languages, formal power series, computer graphics, and combinatorics of words. This book contains research papers by almost all leading authorities and by many of the most promising young researchers in the field. The 28 contributions are organized in sections on basic L systems, computer graphics, graph grammars and map L systems, biological aspects and models, and variations and generalizations of L systems. The introductory paper by Lindenmayer and J}rgensen was written for a wide audience and is accessible to the non-specialist reader. The volume documents the state of the art in the theory of L systems and their applications. It will interest researchers and advanced students in theoretical computer science and developmental biology as well as professionals in computer graphics.
 

Avis des internautes - Rédiger un commentaire

Aucun commentaire n'a été trouvé aux emplacements habituels.

Table des matières

discretestate models for growth
3
Regularity properties of L ambiguities of morphisms
25
J Honkala
47
Alternating iteration of morphisms and the Kolakovski sequence
93
K Culik II J Karhumäki A Lepistö
107
T Yokomori
131
Simplifications of E0L grammars
149
The complexity of the emptiness problem for E0L systems
167
from formalism to programming languages
193
potential and limitations 213
212
T W Chien H Jürgensen
231
On synchronized Lindenmayer picture languages 253
252
Parallel hyperedge replacement 271
270
H Ehrig G Taenzer
303
systems with multiple markers
319
Droits d'auteur

AOL and CFGsize of languages
177

Autres éditions - Tout afficher

Expressions et termes fréquents

Informations bibliographiques