Theoretical computer science.
(Theoretische Informatik.)

*(German)*Zbl 0867.68002
Wiesbaden: Vieweg. ix, 246 p. (1995).

This is a German textbook on foundations of Theoretical Computer Science. It stems from course material of graduate courses for computer scientists, engineers and mathematicians at a polytechnic level (Technische Fachhochschule Berlin).

The book covers the standard topics in theoretical computer science, that is (following the chapters) mathematical foundations, algorithm (including Turing machines and grammars), theory of computing and decidability, complexity, concurrency. A final chapter deals with self-modifying and self-reproducing algorithms and their applications and consequences for computer viruses.

The book is written in a very readable and intuitive style. It does not contain formal proofs. At several places, immediate applications of the theory are provided, e.g. a UNIX shell script demonstrates and simulates the behavior of Turing machines. Every chapter contains exercises which are solved at the end of the book.

The book covers the standard topics in theoretical computer science, that is (following the chapters) mathematical foundations, algorithm (including Turing machines and grammars), theory of computing and decidability, complexity, concurrency. A final chapter deals with self-modifying and self-reproducing algorithms and their applications and consequences for computer viruses.

The book is written in a very readable and intuitive style. It does not contain formal proofs. At several places, immediate applications of the theory are provided, e.g. a UNIX shell script demonstrates and simulates the behavior of Turing machines. Every chapter contains exercises which are solved at the end of the book.

Reviewer: J.Desel (Karlsruhe)

##### MSC:

68-01 | Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science |

68M99 | Computer system organization |

68Qxx | Theory of computing |