The Pre-Loved edit from Shopbop
$56.06 with 72 percent savings
List Price: $199.95
FREE delivery December 6 - 9. Details
Only 2 left in stock - order soon.
$$56.06 () Includes selected options. Includes initial monthly payment and selected options. Details
Price
Subtotal
$$56.06
Subtotal
Initial payment breakdown
Shipping cost, delivery date, and order total (including tax) shown at checkout.
Ships from
textbooks_source
Ships from
textbooks_source
Returns
Returnable until Jan 31, 2025
Returnable until Jan 31, 2025
For the 2024 holiday season, eligible items purchased between November 1 and December 31, 2024 can be returned until January 31, 2025.
Returns
Returnable until Jan 31, 2025
For the 2024 holiday season, eligible items purchased between November 1 and December 31, 2024 can be returned until January 31, 2025.
Payment
Secure transaction
Your transaction is secure
We work hard to protect your security and privacy. Our payment security system encrypts your information during transmission. We don’t share your credit card details with third-party sellers, and we don’t sell your information to others. Learn more
Payment
Secure transaction
We work hard to protect your security and privacy. Our payment security system encrypts your information during transmission. We don’t share your credit card details with third-party sellers, and we don’t sell your information to others. Learn more
Kindle app logo image

Download the free Kindle app and start reading Kindle books instantly on your smartphone, tablet, or computer - no Kindle device required.

Read instantly on your browser with Kindle for Web.

Using your mobile phone camera - scan the code below and download the Kindle app.

QR code to download the Kindle App

Follow the author

Something went wrong. Please try your request again later.

Introducing the Theory of Computation 1st Edition

4.2 4.2 out of 5 stars 15 ratings

{"desktop_buybox_group_1":[{"displayPrice":"$56.06","priceAmount":56.06,"currencySymbol":"$","integerValue":"56","decimalSeparator":".","fractionalValue":"06","symbolPosition":"left","hasSpace":false,"showFractionalPartIfEmpty":true,"offerListingId":"OGWJRAT1As%2BgVa6Ojdx28P0FhGfXROPWcOffRPSR0NJ5W35GbjPH1YWjZO4oT9ZuCBfg62UbqTxZ4BbzAPk683YpVS79FV%2BNP8VX4IrLzdDZ%2B0tJzP5Vhhuw5zncSKD3Mnm6xpbMsmK8Jb2aXo9YsYl%2F1vJF%2BlHzzup89YFbeeKzFVxErB8b9w%3D%3D","locale":"en-US","buyingOptionType":"NEW","aapiBuyingOptionIndex":0}]}

Purchase options and add-ons

Introducing the Theory of Computation is the ideal text for an undergraduate course in the Theory of Computation or Automata Theory. The text covers the standard three models of finite automata, grammars, and Turing machines, as well as undecidability and an introduction to complexity theory. Solutions for selected exercises are included as an appendix.

Amazon First Reads | Editors' picks at exclusive prices

Editorial Reviews

About the Author

Wayne Goddard is currently as Associate Professor in the School of Computing at Clemson University having previously taught at the Universities of KwaZulu-Natal and Pennsylvania. His research interests are graph theory, algorithms, networks and combinatorics. He received his PhDs from the University of KwaZulu-Natal and the Massachusetts Institute of Technology. He has published over 100 journal and conference papers in many areas of graph theory as well as in graph algorithms, self-stabilizing algorithms, game-playing and ad hoc networks, and is co-author of a textbook on Research Methodology.

Product details

  • Publisher ‏ : ‎ Jones & Bartlett Learning; 1st edition (February 12, 2008)
  • Language ‏ : ‎ English
  • Paperback ‏ : ‎ 228 pages
  • ISBN-10 ‏ : ‎ 0763741256
  • ISBN-13 ‏ : ‎ 978-0763741259
  • Item Weight ‏ : ‎ 1.4 pounds
  • Dimensions ‏ : ‎ 7.5 x 1 x 9.25 inches
  • Customer Reviews:
    4.2 4.2 out of 5 stars 15 ratings

About the author

Follow authors to get new release updates, plus improved recommendations.
Wayne Goddard
Brief content visible, double tap to read full content.
Full content visible, double tap to read brief content.

Discover more of the author’s books, see similar authors, read book recommendations and more.

Customer reviews

4.2 out of 5 stars
15 global ratings

Top reviews from the United States

Reviewed in the United States on November 16, 2012
I had to get this book for class but I really like it as a textbook.

I like how the author clearly explains so much in short chapters and gives helpful examples.

Interesting topic, understandable text book.
One person found this helpful
Report
Reviewed in the United States on June 1, 2016
A great textbook but a little too pricey. This textbook does a great job of clearly and concisely communicates many concepts of computation theory. I found it to be very accessibility and not too boring. This is one of the few textbooks that I actually read. A plus is that it isn't too heavy either.

I'd strongly recommend finding this book either used or find a cheap digital copy online. ~$190 feels way too steep for what it is though.
One person found this helpful
Report
Reviewed in the United States on February 25, 2015
I enjoyed the humor scattered throughout the book.
Reviewed in the United States on July 7, 2010
I am going to start by suggested that there are two types of people when it comes to judging books on automata - those who think that mathematical notation makes a subject easy to understand due to its clarity and succinctness and those who are not helped appreciably in their understanding by mathematical notation. Even though I teach computer science at the college level, I am one of the later people. I find the overwhelming majority of my students are among the later as well.
I am teaching an automata course for the second time this fall. While I used the Goddard book my first time around I wanted to make sure I wasn't missing anything, so I spent the summer reading automata textbooks. Now I'm going to use the Goddard book again because it's the only one I've found that I think will make sense to my students. Goddard manages to explain automata and grammars in English and then provide the minimal amount of mathematical notation that's required to deal with the field. This is the only book I've read that manages this. Just go ahead click on the look inside and look at the first pages of the book. They are quite different than other automata textbooks.
It's not a perfect book. The sections on complexity (N <-> NP) are too short. It makes no real effort to explain parsing. I would prefer using the Chomsky hierarchy as an organizing technique rather than an afterthought. But, for the non-math reader it is far the best for the basics of automata theory that I've been able to find.
Even if this book is not assigned for your course you may want to read it to get an understanding of the topics.
11 people found this helpful
Report
Reviewed in the United States on September 10, 2016
Good condition for the most part
Reviewed in the United States on September 27, 2009
There's not too much I can say about this book other than my Professor required that I buy it. That being said, it's fairly understandable considering the subject it covers.

Top reviews from other countries

Dan Guenther
5.0 out of 5 stars Five Stars
Reviewed in Canada on January 17, 2016
Probably the most straightforward and easy to follow textbook I've ever seen.
Amazon Customer
1.0 out of 5 stars Damaged copy received.
Reviewed in India on September 22, 2017
Received the book with the back cover damaged.