Introduction to the Theory of Computation -

bun_books
(11)
Seller's other items
Contact seller
US $25.00
ApproximatelyS$ 32.52
or Best Offer
Condition:
Very Good
Shipping:
US $5.97 (approx S$ 7.77) USPS Media MailTM.
Located in: San Diego, California, United States
Delivery:
Estimated between Tue, 4 Nov and Fri, 7 Nov to 94104
Delivery time is estimated using our proprietary method which is based on the buyer's proximity to the item location, the shipping service selected, the seller's shipping history, and other factors. Delivery times may vary, especially during peak periods.
Returns:
No returns accepted.
Coverage:
Read item description or contact seller for details. See all detailsSee all details on coverage
(Not eligible for eBay purchase protection programmes)
Seller assumes all responsibility for this listing.
eBay item number:406075141645

Item specifics

Condition
Very Good: A book that has been read but is in excellent condition. No obvious damage to the cover, ...
ISBN
9781133187790
Category

About this product

Product Identifiers

Publisher
Cengage Learning
ISBN-10
113318779X
ISBN-13
9781133187790
eBay Product ID (ePID)
16038636117

Product Key Features

Number of Pages
504 Pages
Publication Name
Introduction to the Theory of Computation
Language
English
Publication Year
2012
Subject
Machine Theory, Computer Science
Features
Revised
Type
Textbook
Author
Michael Sipser
Subject Area
Computers
Format
Hardcover

Dimensions

Item Height
9.3 in
Item Weight
26.5 Oz
Item Length
1 in
Item Width
6.5 in

Additional Product Features

Edition Number
3
Intended Audience
College Audience
LCCN
2012-938665
Reviews
The text meets my objectives very well. The author presents the material in an appealing manner, making a hard subject accessible and intuitive to the students. He manages to do that while maintaining the rigor and formalism that the subject warrants. The book has a lot of information packed in it, and can serve as a reference book for students interested in research in theoretical CS., Excellent prose (simple and succinct) with very good diagrams. It is by far the best presentation of automata in the business.
Dewey Edition
23
Dewey Decimal
511.35
Table Of Content
Introduction. PART 1: AUTOMATA AND LANGUAGES. 1. Regular Languages. 2. Context-Free Languages. PART 2: COMPUTABILITY THEORY. 3. The Church-Turing Thesis. 4. Decidability. 5. Reducibility. 6. Advanced Topics in Computability Theory. PART 3: COMPLEXITY THEORY. 7. Time Complexity. 8. Space Complexity. 9. Intractability. 10. Advanced Topics in Complexity Theory. Selected Bibliography.
Edition Description
Revised edition
Synopsis
Gain a clear understanding of even the most complex, highly theoretical computational theory topics in the approachable presentation found only in the market-leading INTRODUCTION TO THE THEORY OF COMPUTATION, 3E. The number one choice for today's computational theory course, this revision continues the book's well-know, approachable style with timely revisions, additional practice, and more memorable examples in key areas. A new first-of-its-kind theoretical treatment of deterministic context-free languages is ideal for a better understanding of parsing and LR(k) grammars. You gain a solid understanding of the fundamental mathematical properties of computer hardware, software, and applications with a blend of practical and philosophical coverage and mathematical treatments, including advanced theorems and proofs. INTRODUCTION TO THE THEORY OF COMPUTATION, 3E's comprehensive coverage makes this a valuable reference for your continued studies in theoretical computing., Born in the latter part of the 20th century from the marriage of mathematics and technology, the theory of computation is how a major discipline permeating science and society. Michael Sipser's popular text gives a broad overview of this fascinating subject/starting from basic principles and covering many beautiful results and exciting unsolved questions. Sipser's approachable style allows students at every level to understand and enjoy this field. His innovative ôproof ideaö sections reveal the intuition underpinning the formal proofs of theorems by explaining profound concepts in plain English. The third edition includes an entirely new section on deterministic context-free languages with connections to parsing and LR(k) grammars. This lucid treatment of complex material illustrates how theoretical insights yield important applications in compiler design. In addition, the new edition-incorporates many improvements that readers have suggested and offers updated problem sets and solutions. Book jacket.
LC Classification Number
QA

Item description from the seller

About this seller

bun_books

100% positive feedback•16 items sold

Joined Jun 2025
Usually responds within 24 hours
Seller's other itemsContact

Seller feedback (12)

All ratingsselected
Positive
Neutral
Negative
See all feedback