Programming Books C Java PHP Python Learn more Browse Programming Books
Buy Used
$39.00
Used: Very Good | Details
Sold by avondaledeals
Condition: Used: Very Good
Comment: Eligible for FREE Super Saving Shipping! Fast Amazon shipping plus a hassle free return policy mean your satisfaction is guaranteed! Tracking number provided with every order. Slight wear on edges and covers; otherwise item is in very good condition. All pages clean, unmarked and perfectly legible.
Access codes and supplements are not guaranteed with used items.
Add to Cart
Have one to sell? Sell on Amazon
Flip to back Flip to front
Listen Playing... Paused   You're listening to a sample of the Audible audio edition.
Learn more
See this image

Models of Computation and Formal Languages Hardcover – October 2, 1997

ISBN-13: 978-0195109832 ISBN-10: 019510983X

Used
Price: $39.00
11 New from $43.82 24 Used from $3.03
Amazon Price New from Used from
Hardcover
"Please retry"
$43.82 $3.03

Free%20Two-Day%20Shipping%20for%20College%20Students%20with%20Amazon%20Student



NO_CONTENT_IN_FEATURE

Save up to 90% on Textbooks
Rent textbooks, buy textbooks, or get up to 80% back when you sell us your books. Shop Now

Product Details

  • Hardcover: 688 pages
  • Publisher: Oxford University Press (October 2, 1997)
  • Language: English
  • ISBN-10: 019510983X
  • ISBN-13: 978-0195109832
  • Product Dimensions: 9.5 x 7.7 x 1.5 inches
  • Shipping Weight: 3.2 pounds
  • Average Customer Review: 4.1 out of 5 stars  See all reviews (7 customer reviews)
  • Amazon Best Sellers Rank: #1,543,071 in Books (See Top 100 in Books)

Editorial Reviews

Review

"A comprehensive, advanced introductory textbook on the theory of computation that can be used on an undergraduate level as well as graduate. The solutions manual and software are welcome additions."--Philip Demp, Rutgers University

Advance praise: "Taylor's work joins a small group of comprehensive yet rigorous, sweeping yet approachable, computer science textbooks. That by itself is a feast, but the dessert is Savoiu's intuitive software that supports almost every chapter by providing working examples, a homework bench, and a model-programming environment." --Benjamin Wells, University of San Francisco

About the Author


R. Gregory Taylor holds degrees from the University of Michigan, New York University, and Columbia University. He is currently chair of the Department of Computer Science at Jersey City State College.

More About the Author

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

Customer Reviews

4.1 out of 5 stars
Share your thoughts with other customers

Most Helpful Customer Reviews

15 of 15 people found the following review helpful By Nancy Tinkham on January 7, 2000
Format: Hardcover
The theory of computing can be a difficult subject to master, because of the densely symbolic notation and the mathematical complexity of the concepts. When I was a graduate student preparing for the theory portion of my exams, I remember being dismayed at the choice of textbooks that was available at the time: most simply threw a collection of Greek letters and subscripts at the reader, with little attempt to provide simply-worded explanations that would give the reader an intuition for the concepts.
Now that I am teaching the theory of computing, I want to provide my students with the best textbook I can find.
Two years ago, I was delighted to find R. Gregory Taylor's new book, "Models of Computation and Formal Languages". This is by far one of the most readable theory textbooks I have encountered. One of the features that caught my eye when I first examined the book was that many of the complicated symbolic expressions are accompanied by little explanatory text boxes with arrows that point to a symbol in the expression and explain the symbol that the arrow points to. I do this in class when I am lecturing -- I point to various symbols and explain where they came from, sometimes jotting down notes on the board alongside the symbols -- but this is the first time I have seen this technique in a textbook.
The writing style of the book is also fairly friendly and informal, without compromising mathematical precision.
The coverage of Turing-equivalent computing models is broader than in most introductory theory books; Taylor includes chapters not only on Turing Machines, but also on Recursive Function Theory, Markov Algorithms, Register Machines, Post Systems, and a model of parallel computation.
Read more ›
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
3 of 4 people found the following review helpful By Anthony Mendoza on January 17, 2000
Format: Hardcover
I was a bit taken aback by the "reader from United States" who gave this book only one star. The subject is difficult so the book is difficult. The book is as readable as possible given the subject matter. As Albert E. once said, "As simple as possible, but no simpler". This book strikes that balance.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
Format: Hardcover Verified Purchase
This is definitely a well-written book that is worth purchasing if you are looking for comprehensive coverage of the material. Although the subject matter is inherently dense, this book presents it very clearly. Definitions and theorems are offset from the regular text in boxes, and there are many diagrams/illustrations that make it easy to get an intuitive grasp of the concept in question. However, there is certainly no dumbing-down of the material; I was looking for a detailed treatment of the subject that had both breadth and depth and Taylor's book certainly fits the bill. I found the book intellectually challenging, but not to such an extent that it was not useful or practical.

In order to provide a reference for the difficulty of the subject matter, I will give a succinct description of my experience and prior knowledge in the subject area. Before purchasing this book, I was familiar with formal languages in general, within the context of their use in natural language processing by computers and in compiler design. I had worked with regular expressions, finite automata, and formal grammars, and had read some of Chomsky's work. However, I was not familiar with the detailed theory of formal languages presented in the second section of this book, and the rigorous treatment was wonderful. There were also many concepts in the first section that were almost entirely new to me, and these proved both interesting and useful.

Overall, I would recommend this book for anyone studying mathematics or computer science at an advanced level.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
0 of 2 people found the following review helpful By A Customer on August 25, 1999
Format: Hardcover
I have several books on this topic. This is the most excellent books along with animated software for each machine.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
Search