## Current Trends in Theoretical Computer Science: Entering the 21st CenturyThe scientific developments at the end of the past millennium were dominated by the huge increase and diversity of disciplines with the common label OC computer scienceOCO. The theoretical foundations of such disciplines have become known as theoretical computer science . This book highlights some key issues of theoretical computer science as they seem to us now, at the beginning of the new millennium. The text is based on columns and tutorials published in the Bulletin of the European Association for Theoretical Computer Science in the period 1995OCo2000. The columnists themselves selected the material they wanted for the book, and the editors had a chance to update their work. Indeed, much of the material presented here appears in a form quite different from the original. Since the presentation of most of the articles is reader-friendly and does not presuppose much knowledge of the area, the book constitutes suitable supplementary reading material for various courses in computer science. Contents: Computational Complexity (E Allender et al.); Formal Specification (H Ehrig et al.); Login in Computer Science (Y Gurevich et al.); Concurrency (M Nielsen et al.); Natural Computing (G Rozenberg et al.); Formal Language Theory (A Salomaa et al.). Readership: Researchers, graduate students and senior undergraduates in computer science." |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Chapter 2 Formal Specification | 115 |

233 | |

Chapter 4 Concurrency | 437 |

Chapter 5 Natural Computing | 543 |

Chapter 6 Formal Language Theory | 691 |

About the Editors | 867 |

### Other editions - View all

### Common terms and phrases

abstract data types algebraic speciﬁcations alphabet applications automata axiom bisimulation Boolean CASL circuits complexity classes components concurrency consider construct context-free decision problem deﬁned deﬁnition denote DNA computing Ehrig equations equivalence evolutionary algorithms example ﬁeld ﬁnd ﬁnding ﬁnite set ﬁrst ﬁrst-order logic ﬁtness ﬁxed formula Frege function genetic algorithms given grammar systems graph transformation hierarchy IEEE inﬁnite input integration isomorphism language processors Lecture Notes linear lower bounds mathematical membrane methods monoid morphism multiset natural numbers neural NLP systems node Notes in Computer notion operations output parallel communicating Paun Petri nets polynomial polynomial-time primitive recursive Proc programming language proof systems prove quantum quantum computation qubits query regular language relation rewriting rigid E-uniﬁcation Rozenberg rules Salomaa satisﬁes semantics sequence sequential simulated solution speciﬁcation speciﬁcation techniques splicing Springer-Verlag string structure symbols Theorem Theoretical Computer Science trajectories transition system Turing machine variables words