The Theory of Computation (Harper & Row Computer Science and Technology Series) [Hardcover]

Derrick Wood (Author)

Book Description

Publication Date: August 1986 | ISBN-10: 0471603511 | ISBN-13: 978-0471603511 | Edition: 1

Presents easily accessible coverage of language theory, concentrating on the major properties of the fundamental and automata models for languages. Focuses on practical applications such as finite automata and pattern matching, regular expressions and text editing, extended context-free grammars, and syntax diagrams. Simple and elegant proofs are given for theorems usually considered difficult (e.g., Parikh's theorem or the proof that every finite automata has an equivalent regular expression). Provides algorithms in a Pascal-like notation which complement discussions of constructions and programming. Each chapter includes a springboard section introducing topics for further investigation. Also provides short exercises and programming projects plus extensive examples.

Product Details

• Hardcover: 576 pages
• Publisher: Wiley; 1 edition (August 1986)
• Language: English
• ISBN-10: 0471603511
• ISBN-13: 978-0471603511
• Product Dimensions: 9.6 x 7.6 x 1.2 inches
• Shipping Weight: 2 pounds
• Average Customer Review: 4.0 out of 5 stars  See all reviews (1 customer review)
• Amazon Best Sellers Rank: #3,896,078 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

1 of 1 people found the following review helpful:

4.0 out of 5 stars It could still be used as a text in computation theory, May 8, 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: Theory of Computation (Hardcover)

In the late 1980's, the college where I was teaching was making a move to offer a course in computation theory. I led that move and while I had some experience in the area, a refresher was needed. This is one of the books that I used to carry out that refresher. It begins with a thorough review of sets, functions, digraphs and basic proof techniques. I consider this essential in any text in computation theory as I have always found it necessary to review this material in my courses.
After these preliminaries, the sequence is:

*) Languages and computation
*) Deterministic and non-deterministic finite automata
*) Regular expressions and their equivalence with finite automata
*) Context-free grammars
*) Pushdown automata
*) Turing machines
*) Decidability

The coverage is complete and the exposition is at a level suitable for the undergraduate having had a course in discrete mathematics. When I was moving through it bringing myself back up to speed, I found it very effective in presenting what I needed to relearn. While I currently use another text in my theory of computation course, despite its' age, I could still use this one.