Lindenmayer Systems: Impacts on Theoretical Computer Science, Computer Graphics, and Developmental BiologyGrzegorz Rozenberg, Arto Salomaa Springer Science & Business Media, 6 déc. 2012 - 514 pages 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. |
À l'intérieur du livre
Résultats 1-5 sur 85
Page
... obtained from Springer- Verlag . Violations are liable for prosecution under the German Copyright Law . © Springer - Verlag Berlin Heidelberg 1992 Softcover reprint of the hardcover 5th edition The use of general descriptive names ...
... obtained from Springer- Verlag . Violations are liable for prosecution under the German Copyright Law . © Springer - Verlag Berlin Heidelberg 1992 Softcover reprint of the hardcover 5th edition The use of general descriptive names ...
Page 7
... obtained as the solution of an exercise in Fibonacci's Liber abbacı [ 9 ] , F 1202 and 1228 concerning the offspring of a single pair of rabbits in one year . 283 , of the same as the rules found with high regularity in 7.
... obtained as the solution of an exercise in Fibonacci's Liber abbacı [ 9 ] , F 1202 and 1228 concerning the offspring of a single pair of rabbits in one year . 283 , of the same as the rules found with high regularity in 7.
Page 10
... obtained structures in a specific order . Thus we have two different ways in which a sequence of growing structures could be specified : by local state - transition rules or by the global composition rules . In observing living ...
... obtained structures in a specific order . Thus we have two different ways in which a sequence of growing structures could be specified : by local state - transition rules or by the global composition rules . In observing living ...
Page 14
... obtain new insights from such lineage studies ? Of course the main question concerns the underlying control factors . The nematode study has been undertaken primarily to search for the genetic factors involved in cell determination and ...
... obtain new insights from such lineage studies ? Of course the main question concerns the underlying control factors . The nematode study has been undertaken primarily to search for the genetic factors involved in cell determination and ...
Page 15
... obtain . Finding the control genes is the next problem . By ' control genes ' we mean those genes which channel a cell or ... obtained by finding the growth matrix M of the system and raising this matrix to the n - th power . The growth ...
... obtain . Finding the control genes is the next problem . By ' control genes ' we mean those genes which channel a cell or ... obtained by finding the growth matrix M of the system and raising this matrix to the n - th power . The growth ...
Table des matières
3 | |
25 | |
47 | |
Alternating iteration of morphisms and the Kolakovski sequence | 93 |
K Culik II J Karhumäki A Lepistö | 107 |
T Yokomori | 131 |
Simplifications of EOL grammars | 149 |
Th Ottmann D Wood | 167 |
AOL and CFGsize of languages | 177 |
from formalism to programming languages | 193 |
P Prusinkiewicz J Hanan | 229 |
On synchronized Lindenmayer picture languages 253 | 252 |
Parallel hyperedge replacement 271 | 270 |
H Ehrig G Taenzer | 303 |
K Aizawa A Nakamura | 319 |
Autres éditions - Tout afficher
Lindenmayer Systems: Impacts on Theoretical Computer Science, Computer ... Grzegorz Rozenberg,Arto Salomaa Aucun aperçu disponible - 1992 |
Lindenmayer Systems: Impacts on Theoretical Computer Science, Computer ... Grzegorz Rozenberg,Arto Salomaa Aucun aperçu disponible - 2012 |
Expressions et termes fréquents
a₁ algebraic lattice algorithm alphabet application assume automata automaton axiom B₁ c₁ called cell division cell system cellular cellular automata colouring compact compact element Computer Science consider construction contains context context-free context-free grammars contradiction corresponding defined definition denote derivation step developmental division wall DOL system edge labels element EOL grammar example exists Figure finite set formal language theory Fr-OL fragments free monoid G₁ G₂ given grammar G graph grammars graph morphisms graphical Hence hyperedge hyperedge replacement implies incomparable infinite integer isomorphic iterations L-systems L₁ Lemma length Lindenmayer map L-system node nonempty nonterminals obtained P₁ parallel communicating parameters pattern PDOL prefix prefix code problem production rules Proof Proposition recursive resp rewriting Rozenberg Salomaa sequence sequential function simulated skew-morphism splicing string structurally equivalent subset symbols syntax tree system G Theorem Um-1-covered Um-covered vector word