Introduction to the theory of computation / Michael Sipser.

By:

Sipser, Michael [author.]

Material type: Text

TextPublisher: Australia : Cengage Learning, 2013Edition: Third edition, international editionDescription: xxii, 458 pages : illustrations ; 24 cmContent type:

text

Media type:

unmediated

Carrier type:

volume

ISBN:

9781133187813

Subject(s):

DDC classification:

511.35 SI.I 2013 23

LOC classification:

QA267 .S56 2006

Online resources:

Contents:

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. Interactibility -- 10. Advanced topics in complexity theory.

Summary: Clearly present even the most complex computational theory topics to your students using Sipser's textbook. This updated edition continues Sipser's approachable style with timely revisions, additional exercises, and more memorable examples in key areas. $b 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, International Edition. The number one choice for today's computational theory course, this revision continues the book's well-known, 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 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, International Edition's comprehensive coverage makes this a valuable reference for your continued studies in theoretical computing.

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Collection	Call number	Status	Date due	Barcode
Books	The Knowledge Hub Library	Computing	511.35 SI.I 2013 (Browse shelf(Opens below))	Available		190508

Includes bibliographical references (pages 443-447) and index.

Clearly present even the most complex computational theory topics to your students using Sipser's textbook. This updated edition continues Sipser's approachable style with timely revisions, additional exercises, and more memorable examples in key areas. $b 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, International Edition. The number one choice for today's computational theory course, this revision continues the book's well-known, 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 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, International Edition's comprehensive coverage makes this a valuable reference for your continued studies in theoretical computing.

There are no comments on this title.

to post a comment.