Theoretical Foundations of Computer Science [Hardcover]

Dino Mandrioli (Author), Carlo Ghezzi (Author)

Book Description

Publication Date: September 1993

Explores basic concepts of theoretical computer science and shows how they apply to current programming practice. Coverage ranges from classical topics, such as formal languages, automata, and compatibility, to formal semantics, models for concurrent computation, and program semantics.

--This text refers to an out of print or unavailable edition of this title.

Product Details

• Hardcover: 504 pages
• Publisher: Krieger Pub Co (September 1993)
• Language: English
• ISBN-10: 0894647989
• ISBN-13: 978-0894647987
• Product Dimensions: 9.4 x 6.3 x 1.3 inches
• Shipping Weight: 2 pounds
• Average Customer Review: 3.7 out of 5 stars  See all reviews (3 customer reviews)
• Amazon Best Sellers Rank: #3,797,138 in Books (See Top 100 in Books)

More About the Author

Discover books, learn about writers, read author blogs, and more.

Customer Reviews

Most Helpful Customer Reviews

3.0 out of 5 stars Part covers computation theory and part covers the theory of programming languages, May 19, 2008

By 

Charles Ashbacher (Marion, Iowa United States) - See all my reviews
(TOP 500 REVIEWER)    (VINE VOICE)    (HALL OF FAME REVIEWER)   

This review is from: Theoretical Foundations of Computer Science (Hardcover)

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.

3.0 out of 5 stars Complete book, poor writing, September 21, 2006

By 

M. Villagra (Nara, Japan) - See all my reviews
(REAL NAME)   

This review is from: Theoretical Foundations of Computer Science (Hardcover)

This book is an introduction to very important fields in computer science. It presents an introduction to the theory of abstract machines (automata), formal languages, complexity analysis and formal semantics.
Gives a formal explanation of the concepts which I apreciate, but for undergraduate students it can be very hard to understand. In any case, it is very dificult to avoid this formal explanation since it is the only way to understand these topics.
At the end of each chapter It presents only a few exercises, and some of them are very dificult to solve (even with the sketchy solutions). Therefore, the student (undergraduate or graduate) cannot completly make good use of this material.
I don't recomend to use this book as a main book for a course, but I recommend it as a backup for the main book, since the explanation of the concepts by means of formal theories can be very useful.
Finally, I give the book a 3 points rating because It doesn't explain very well the concepts in plain english and It only presents very few examples. Also, the exercises are sometimes very dificult to solve and the sketchy solutions are not very helpful. Nevertheless, it is one of the most complete books about theoretical computer science.

0 of 1 people found the following review helpful:

5.0 out of 5 stars This is a bible!, May 7, 2011

By 

American Science & Surplus Red Laser Poin... - See all my reviews

Amazon Verified Purchase

This review is from: Theoretical Foundations of Computer Science (Hardcover)

I'm a University Teacher in Paraguay, and we being using this book permanently. Its the BIBLE of Computational Theory. Thanks!