**Auteur :**

**la langue :** en

**Éditeur:** Academic Press

**Date de sortie :** 1980-04-29

The Mathematical Theory of L Systems

**Auteur :** John L. Rhodes

**la langue :** en

**Éditeur:** World Scientific

**Date de sortie :** 2010

This book was originally written in 1969 by Berkeley mathematician John Rhodes. It is the founding work in what is now called algebraic engineering, an emerging field created by using the unifying scheme of finite state machine models and their complexity to tie together many fields: finite group theory, semigroup theory, automata and sequential machine theory, finite phase space physics, metabolic and evolutionary biology, epistemology, mathematical theory of psychoanalysis, philosophy, and game theory. The author thus introduced a completely original algebraic approach to complexity and the understanding of finite systems. The unpublished manuscript, often referred to as "The Wild Book," became an underground classic, continually requested in manuscript form, and read by many leading researchers in mathematics, complex systems, artificial intelligence, and systems biology. Yet it has never been available in print until now. This first published edition has been edited and updated by Chrystopher Nehaniv for the 21st century. Its novel and rigorous development of the mathematical theory of complexity via algebraic automata theory reveals deep and unexpected connections between algebra (semigroups) and areas of science and engineering. Co-founded by John Rhodes and Kenneth Krohn in 1962, algebraic automata theory has grown into a vibrant area of research, including the complexity of automata, and semigroups and machines from an algebraic viewpoint, and which also touches on infinite groups, and other areas of algebra. This book sets the stage for the application of algebraic automata theory to areas outside mathematics. The material and references have been brought up to date bythe editor as much as possible, yet the book retains its distinct character and the bold yet rigorous style of the author. Included are treatments of topics such as models of time as algebra via semigroup theory; evolution-complexity relations applicable to both ontogeny and evolution; an approach to classification of biological reactions and pathways; the relationships among coordinate systems, symmetry, and conservation principles in physics; discussion of "punctuated equilibrium" (prior to Stephen Jay Gould); games; and applications to psychology, psychoanalysis, epistemology, and the purpose of life. The approach and contents will be of interest to a variety of researchers and students in algebra as well as to the diverse, growing areas of applications of algebra in science and engineering. Moreover, many parts of the book will be intelligible to non-mathematicians, including students and experts from diverse backgrounds.

**Auteur :** Susanne C Brenner

**la langue :** en

**Éditeur:** Springer Science & Business Media

**Date de sortie :** 2013-03-14

A rigorous and thorough mathematical introduction to the subject; A clear and concise treatment of modern fast solution techniques such as multigrid and domain decomposition algorithms; Second edition contains two new chapters, as well as many new exercises; Previous edition sold over 3000 copies worldwide

**Auteur :** Przemyslaw Prusinkiewicz

**la langue :** en

**Éditeur:** Springer Science & Business Media

**Date de sortie :** 2012-12-06

Now available in an affordable softcover edition, this classic in Springer's acclaimed Virtual Laboratory series is the first comprehensive account of the computer simulation of plant development. 150 illustrations, one third of them in colour, vividly demonstrate the spectacular results of the algorithms used to model plant shapes and developmental processes. The latest in computer-generated images allow us to look at plants growing, self-replicating, responding to external factors and even mutating, without becoming entangled in the underlying mathematical formulae involved. The authors place particular emphasis on Lindenmayer systems - a notion conceived by one of the authors, Aristid Lindenmayer, and internationally recognised for its exceptional elegance in modelling biological phenomena. Nonetheless, the two authors take great care to present a survey of alternative methods for plant modelling.

**Auteur :** Julius T. Tou

**la langue :** en

**Éditeur:** Springer Science & Business Media

**Date de sortie :** 2012-12-06

Information systems science is rapidly advancing in many directions. Di versified ideas, methodologies, and techniques as well as applications have been conceived and developed. This series intends to discuss some of the recent advances in this field. In this volume, we cover four timely topics which are of great current interest. In each chapter, an attempt is made to familiarize the reader with some basic background information on the ad vances discussed. The emphasis of this volume is placed upon parallel pro gramming, data structure models in information system design, and the principles of L systems. One of the effective means to enhance computation performance is parallel information processing on multiprocessor systems. In Chapter I, V. E. Kotov discusses the practical aspects of parallel programming. He is concerned with the languages and methods of parallel programming, per formance an~lysis, and automatic synthesis of parallel programs. In Chapter 2, A. S. Narin'yani presents the formal theory of parallel computations. These two chapters attempt to correlate and classify various methods in parallel programming, thus providing the reader with a unified approach to this important subject matter. Data structures play an important role in information system design.

**Auteur :** Ronald V. Book

**la langue :** en

**Éditeur:** Academic Press

**Date de sortie :** 2014-05-10

Formal Language Theory: Perspectives and Open Problems focuses on the trends and major open problems on the formal language theory. The selection first ponders on the methods for specifying families of formal languages, open problems about regular languages, and generators of cones and cylinders. Discussions focus on cylinders of algebraic languages, cone of algebraic languages, regularity of noncounting classes, group complexity, specification formalism, and grammars. The publication then elaborates on very small families of algebraic nonrational languages and formal languages and their relation to automata. The book tackles morphisms on free monoids and language theory, homomorphisms, and survey of results and open problems in the mathematical theory of L systems. Topics include single finite substitutions iterated, single homomorphisms iterated, representation of language families, homomorphism equivalence on a language, and problems about infinite words. The selection is a valuable source of data for researchers interested in the formal language theory.