Cantitate/Preț
Produs

The Book of L

Editat de G. Rozenberg, A. Salomaa
en Limba Engleză Paperback – 9 feb 2012
This book is dedicated to Aristid Lindenmayer on the occasion of his 60th birthday on November 17, 1985. Contributions range from mathematics and theoretical computer science to biology. Aristid Lindenmayer introduced language-theoretic models for developmental biology in 1968. Since then the models have been cus­ tomarily referred to as L systems. Lindenmayer's invention turned out to be one of the most beautiful examples of interdisciplinary science: work in one area (developmental biology) induces most fruitful ideas in other areas (theory of formal languages and automata, and formal power series). As evident from the articles and references in this book, the in­ terest in L systems is continuously growing. For newcomers the first contact with L systems usually happens via the most basic class of L systems, namely, DOL systems. Here "0" stands for zero context between developing cells. It has been a major typographical problem that printers are unable to distinguish between 0 (zero) and 0 (oh). Thus, DOL was almost always printed with "oh" rather than "zero", and also pronounced that way. However, this misunderstanding turned out to be very fortunate. The wrong spelling "DOL" of "DOL" could be read in the suggestive way: DO L Indeed, hundreds of researchers have followed this suggestion. Some of them appear as contributors to this book. Of the many who could not contribute, we in particular regret the absence of A. Ehrenfeucht, G. Herman and H.A. Maurer whose influence in the theory of L systems has been most significant.
Citește tot Restrânge

Preț: 63964 lei

Preț vechi: 79955 lei
-20% Nou

Puncte Express: 959

Preț estimativ în valută:
12241 12837$ 10207£

Carte tipărită la comandă

Livrare economică 08-22 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783642954887
ISBN-10: 364295488X
Pagini: 492
Ilustrații: XV, 471 p.
Dimensiuni: 170 x 244 x 26 mm
Greutate: 0.78 kg
Ediția:Softcover reprint of the original 1st ed. 1986
Editura: Springer Berlin, Heidelberg
Colecția Springer
Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Investigations into Drosophila Wing Development — Results from a Lindenmayer Model.- Fibonacci Words — A Survey.- Planar Map Generation by Parallel Binary Fission/Fusion Grammars.- Modular Trellises.- A New Proof for the DOL Sequence Equivalence Problem and its Implications.- On Compound Lindenmayer Systems.- Graph Grammars with Application Conditions.- The ETOL Hierarchy is in the OI Hierarchy.- Polyhedral Cell Shapes.- On Cyclically Overlap-Free Words in Binary Alphabets.- The Theoretical Basis of the Transplantation Experiment.- Fixed and Stationary ?-Words and ?-Languages.- DOL Schemes and Recurrent Words.- Stochastic OL Systems and Formal Power Series.- Complexity of L-Systems.- Compartmental Hybrid State Production-Diffusion Systems with Application to Prestalk-Prespore Pattern Regulation in Cellular Slime Molds.- Hierarchical Aspects of Plant Development.- Rule Trees Represent Derivations in Edge Replacement Systems.- Languages Defined by Indian Parallel Systems.- L Systems and NLOG-Reductions.- The Parikh-Boundedness of ETOL Languages of Finite Index.- Computer Networks with Compact Routing Tables.- Unconventional Leaves.- A Uniform Model for the Growth of Biological Organisms: Cooperating Sequential Processes.- Graph Technology Applied to a Software Project.- Some Systems for Map Generation.- A Programming Language for Lindenmayer Systems.- A Note on Significance of Cellular Interaction in L-System.- EOL Grammars and Search Trees.- Variation in Inflorescence Structure in Cotoneaster Franchetti.- Partial Path Groups and Parallel Graph Contractions.- When L was Young.- Equivalence Problems for Regular Sets of Word Morphisms.- Parentheses Grammars and Lindenmayer Grammars.- Array Languages and Lindenmayer Systems — A Survey.- Symmetric DistributedTermination.- Development, Growth and Time.- On the Set of all Subgraphs of the Graphs in a Boundary NLC Graph Language.- Graph-Controlled Systems — An Extension of OL Systems.