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 80
Page 4
... exists a second thing , the ' program , ' whose structure is isomorphic with , that is , can be brought into one - to - one correspondence with , the phenomenon . " Considering development , " it is most unlikely that the overall ...
... exists a second thing , the ' program , ' whose structure is isomorphic with , that is , can be brought into one - to - one correspondence with , the phenomenon . " Considering development , " it is most unlikely that the overall ...
Page 28
... exists a positive integer n such that h3 ( x ) = x . The letter x € X is called h - semibounded ( or h - pumping ) if there exist a positive integer m and words u , v € X * containing only h - bounded letters such that h TM ( x ) = uxv ...
... exists a positive integer n such that h3 ( x ) = x . The letter x € X is called h - semibounded ( or h - pumping ) if there exist a positive integer m and words u , v € X * containing only h - bounded letters such that h TM ( x ) = uxv ...
Page 34
... exists a path from ( a , a ) to ( u , v ) in 4 , ( p , B ) through the states of s ( 2 ) } and T ( 3 ) = € y + { t e T❘ there exists a path from ( ^ , ^ ) to t in ( P , B ) through the states of S U T } . ( 3 ) Suppose now that p ( b1 ...
... exists a path from ( a , a ) to ( u , v ) in 4 , ( p , B ) through the states of s ( 2 ) } and T ( 3 ) = € y + { t e T❘ there exists a path from ( ^ , ^ ) to t in ( P , B ) through the states of S U T } . ( 3 ) Suppose now that p ( b1 ...
Page 38
... exists i w k such that ( u , v ) € S¡ } . Furthermore , denote N2 max { | c1p ( c2 ) ... pk - 1 ( c ) || c ; e B ) ... exist b1 , b2b b1 , b2 , ... , bk E B and ( u ' , v ' ) e S such that u ̄1b1p ( b2 ) ... pk1 ( b ) p ( u ) k - 1 k - 1 ...
... exists i w k such that ( u , v ) € S¡ } . Furthermore , denote N2 max { | c1p ( c2 ) ... pk - 1 ( c ) || c ; e B ) ... exist b1 , b2b b1 , b2 , ... , bk E B and ( u ' , v ' ) e S such that u ̄1b1p ( b2 ) ... pk1 ( b ) p ( u ) k - 1 k - 1 ...
Page 40
... exists a positive integer N , such that if ( u , v ) e S s ( 3 ) ns ( 2 ) and v ( resp . u ) contains only bounded letters then the length of v ( resp . u ) is at most Ng . Proof . We only sketch the argument because no new idea is e s ...
... exists a positive integer N , such that if ( u , v ) e S s ( 3 ) ns ( 2 ) and v ( resp . u ) contains only bounded letters then the length of v ( resp . u ) is at most Ng . Proof . We only sketch the argument because no new idea is e s ...
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