Theoretical Foundations of Computer Science

1 rating: 1.0

A book by Dino Mandrioli

This new text discusses the basic concepts of theoretical computer science (formal languages, automata theory and the theory of computability) and shows their application to current programming practice. It emphasizes the practical use of theory in current, … see full wiki

Tags: Books

Author: Dino Mandrioli

Publisher: John Wiley & Sons Inc

1 review about Theoretical Foundations of Computer Science

Showing 1-1 of 1

Sort by:

Part covers computation theory and part covers the theory of programming languages

May 19, 2008

by CharlesAshbacher
posted in Cafe Libri: Reviewing Books & More

Rating:

In the context of what we offer at the school where I teach, this book is a bit schizophrenic. The material in the first part would be reasonably suitable for our course in computation theory and the material of the last part for our course in programming language concepts.
The first section covers finite automata, pushdown automata and Turing machines. In the second part of the initial section, solvable and unsolvable problems and computational complexity are covered. The last section of the book deals with formal semantics, both operational and denotational. In the last two chapters, proving program correctness and parallel computation are examined.
While this book certainly retains value as a reference, it is difficult to see where it could be used as a textbook in a computer science curriculum.

What did you think of this review?

Helpful

Thought-Provoking

Fun to Read

Well-Organized