This introduction to certain mathematical topics central to theoretical computer science treats computability and recursive functions, formal languages and automata, computational complexity, and cruptography. The presentation is essentially self-contained with detailed proofs of all statements provided. Although it begins with the basics, it proceeds to some of the most important recent developments in theoretical computer science.

This volume originated in the Workshop on Membrane Computing, WMC- CdeA 2002, which took place in Curtea de Arge, s, Romania, during August 19- 23, 2002.This was the third annual workshop held in Curtea de Arge, s.The rst one, Workshop on Multiset Processing, WMP-CdeA 2000, took place in August 2000, and the proceedings were published in Lecture Notes in Computer Science, volume 2235.The second one, Workshop on Membrane Comp- ing, WMC-CdeA 2001, took place in August 2001, and selected papers were published as a special issue of Fundamenta Informaticae, volume 49, numbers 1-3, 2002. The aim of...

This volume contains the proceedings of ICALP 88, held at Tampere University of Technology, Finland, July 11-15, 1988. ICALP 88 is the 15th International Colloquium on Automata, Languages and Programming in a series of meetings sponsored by the European Association for Theoretical Computer Science (EATCS). It is a broadly based conference covering all aspects of theoretical computer science including topics such as computability, automata, formal languages, analysis of algorithms, computational complexity, data types and data structures, theory of data bases and knowledge bases, semantics of...

This book is dedicated to Andrzej Ehrenfeucht on the occasion of his 65th birthday. On personal invitation by the volume editors, 22 internationally well-known scientists from mathematical logics and theoretical computer science participated in this project honoring an excellent scientist with excellent papers centered around his scientific work.
The 22 invited papers are presented in topical sections on model theory, games and logic, graphs and algorithms, pattern matching and learning, combinatorics of words, algebra of languages, formal language theory, and computational molecular...

The need for a comprehensive survey-type exposition on formal languages and related mainstream areas of computer science has been evident for some years. In the early 1970s, when the book Formal Languages by the second- mentioned editor appeared, it was still quite feasible to write a comprehensive book with that title and include also topics of current research interest. This would not be possible anymore. A standard-sized book on formal languages would either have to stay on a fairly low level or else be specialized and restricted to some narrow sector of the field. The setup becomes...

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 book gives a broad overview of public-key cryptography - its essence and advantages, various public-key cryptosystems, and protocols - as well as a comprehensive introduction to classical cryptography and cryptoanalysis. The second edition has been revised and enlarged especially in its treatment of cryptographic protocols. From a review of the first edition: "This is a comprehensive review ... there can be...

Part of the broader research field of natural computing, Membrane Computing is an area within computing science that aims to abstract computing ideas and models from the structure and functioning of living cells, as well as from the way the cells are organized in tissues or higher order structures. It studies models of computation (known as P systems) inspired by the biochemistry of cells, in particular by the role of membranes in the compartmentalization of living cells into "protected reactors."
This handbook provides both a comprehensive survey of available knowledge and established...

L systems are language-theoretic models for developmental biology. This book contains research papers in the field. It is organized into sections on basic L systems, computer graphics, graph grammars and map L systems, biological aspects and models, and variations and generalizations of L systems.

This introduction to certain mathematical topics central to theoretical computer science treats computability and recursive functions, formal languages and automata, computational complexity, and cruptography. The presentation is essentially self-contained with detailed proofs of all statements provided. Although it begins with the basics, it proceeds to some of the most important recent developments in theoretical computer science.

The need for a comprehensive survey-type exposition on formal languages and related mainstream areas of computer science has been evident for some years. In the early 1970s, when the book Formal Languages by the second- mentioned editor appeared, it was still quite feasible to write a comprehensive book with that title and include also topics of current research interest. This would not be possible anymore. A standard-sized book on formal languages would either have to stay on a fairly low level or else be specialized and restricted to some narrow sector of the field. The setup becomes...