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

By Derrick Wood

Intended to be used as the basis of a one- or two-term introductory course in the theory of computation, this book concentrates on the fundamental models for languages and computation together with their properties. It contains simple proofs of many results that are usually considered difficult. For example the proof given to show that every finite automaton has an equivalent regular expression is little known.

• Format: Hardcover
• Language: English
• ISBN: 0471603511
• ISBN13: 9780471603511
• Release Date: August 1986
• Publisher: Wiley
• Length: 576 Pages
• Weight: 2.68 lbs.
• Dimensions: 9.6" x 1.2" x 7.6"

Customer Reviews

It could still be used as a text in computation theory

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.