Theory of Computation: Formal Languages, Automata, and Complexity

by J. Glenn Brookshear

No Synopsis Available.

• Format: Paperback
• Language: English
• ISBN: 0805301437
• ISBN13: 9780805301434
• Release Date: January 1989
• Publisher: Pearson
• Length: 320 Pages
• Weight: 1.55 lbs.
• Dimensions: 0.6" x 7.0" x 9.1"

Customer Reviews

really great book

this is an excelent book, too bad it's hard to find. Dr brookshear explains very well the theory, without going too deep in not-so-significant subjects, but he does mention them (sometimes in the chapter exercises), so you can look for them on your own. really worth finding it

Fantastic text that needs to be reprinted

This is a fantastic text that I'd recommend to anyone studying Formal Languages and Computation. I also had the honor of taking this course at Marquette University, taught by Dr. Brookshear himself. His book is very well written, clear and consise, with fantastic examples of the concepts he writes about.

Practical exposition of sound computer science concepts

I am very thankful to the author of this book. Now I understand and articulate very important computer science concepts, finally.Very practical and clear expositions with examples and a step by step style, there is no room for doubts.Thanks, very good book.

An outstanding and unique book

It was sad for me to learn that this one book is now out-of-print. Back in 1990 when I bought it, it was the very first book to explain some of the most exciting subjects in theory of computation in a way that it is so clear and motivating. When I read it again, the same thoughts come back to my mind. This book is very well written. It is a shame that so many computer science students and researchers may now not have the opportunity to learn from it too.