Bøger af Arto Salomaa

L systems are language-theoretic models for developmentalbiology. They wereintroduced in 1968 by Aristid Lindenmayer(1925-1989) and have proved to be among the most beautifulexamples of interdisciplinary science, where work in onearea induces fruitful ideas and results in other areas. Lsystemsare based on relational and set-theoretic concepts,which are more suitable for the discrete and combinatorialstructures of biology than mathematical models based oncalculus or statistics. L systems have stimulated new worknot only in the realistic simulation of developing organismsbut also in the theory of automata and formal languages,formal power series, computer graphics, and combinatorics ofwords. This book contains research papers by almost all leadingauthorities and by many of the most promising youngresearchers in the field. The 28 contributions are organizedin sections on basic L systems, computer graphics, graphgrammars and map L systems, biological aspects and models,and variations and generalizations of L systems. Theintroductory paper by Lindenmayer and J}rgensen was writtenfor a wide audience and is accessible to the non-specialistreader. The volume documents the state of the art in the theory of Lsystems and their applications. It will interest researchersand advanced students in theoretical computer science anddevelopmental biology as well as professionals in computergraphics.

A fundamental understanding of algorithmic bioprocesses is key to learning how information processing occurs in nature at the cell level. The field is concerned with the interactions between computer science on the one hand and biology, chemistry, and DNA-oriented nanoscience on the other. In particular, this book offers a comprehensive overview of research into algorithmic self-assembly, RNA folding, the algorithmic foundations for biochemical reactions, and the algorithmic nature of developmental processes.The editors of the book invited 36 chapters, written by the leading researchers in this area, and their contributions include detailed tutorials on the main topics, surveys of the state of the art in research, experimental results, and discussions of specific research goals. The main subjects addressed are sequence discovery, generation, and analysis; nanoconstructions and self-assembly; membrane computing; formal models and analysis; process calculi and automata; biochemical reactions; and other topics from natural computing, including molecular evolution, regulation of gene expression, light-based computing, cellular automata, realistic modelling of biological systems, and evolutionary computing. This subject is inherently interdisciplinary, and this book will be of value to researchers in computer science and biology who study the impact of the exciting mutual interaction between our understanding of bioprocesses and our understanding of computation.

Cryptography, secret writing, is probably as old as writing itself. But only recently has it become the object of extensive scientific studies. Vast new applications to data security are one explanation for this. Perhaps a more important reason for the huge growth of scientific research on cryptography is the seminal idea of public-key cryptography and the resulting new vistas on the possibilities of communication. This book gives a broad overview of public-key cryptography, covering its essence and advantages, various public-key cryptosystems and protocols. It also gives a comprehensive introduction to classical cryptography and cryptanalysis. The book is self-contained and suitable both as a text and as a reference. It starts from the beginning but also includes some 1989 developments. The presentation is in many ways new, with some new results. The treatment is rigorous but avoids unnecessary formalism. The plaintext examples in the book form a package of basic sauna knowledge.

This book develops a theory of formal power series in noncommuting variables, the main emphasis being on results applicable to automata and formal language theory. This theory was initiated around 196O-apart from some scattered work done earlier in connection with free groups-by M. P. Schutzenberger to whom also belong some of the main results. So far there is no book in existence concerning this theory. This lack has had the unfortunate effect that formal power series have not been known and used by theoretical computer scientists to the extent they in our estimation should have been. As with most mathematical formalisms, the formalism of power series is capable of unifying and generalizing known results. However, it is also capable of establishing specific results which are difficult if not impossible to establish by other means. This is a point we hope to be able to make in this book. That formal power series constitute a powerful tool in automata and language theory depends on the fact that they in a sense lead to the arithmetization of automata and language theory. We invite the reader to prove, for instance, Theorem IV. 5. 3 or Corollaries III. 7. 8 and III. 7.- all specific results in language theory-by some other means. Although this book is mostly self-contained, the reader is assumed to have some background in algebra and analysis, as well as in automata and formal language theory.

In this book, which was originally published in 1985, Arto Salomaa gives an introduction to certain mathematical topics central to theoretical computer science: computability and recursive functions, formal languages and automata, computational complexity and cryptography. Without sacrificing readability, the presentation is essentially self-contained, with detailed proofs of all statements provided. Professor Salomaa is well known for his books in this area. The present work provides an insight into the basics, together with explanations of some of the more important developments in the field.

Cryptography, secret writing, is enjoying a scientific renaissance following the seminal discovery in 1977 of public-key cryptography and applications in computers and communications.

This is the first book on DNA computing, a molecular approach that may revolutionize computing-replacing silicon with carbon and microchips with DNA molecules. The book starts with an introduction to DNA computing, exploring the power of complementarity, the basics of biochemistry, and language and computation theory.