Introduction to the theory of computation / Michael Sipser.
Material type:
TextPublication details: Boston : Thomson Course Technology, c2006.Edition: 2nd ed., international edDescription: xvii, 437 p. : ill. ; 25 cmISBN: - 9780619217648
- 0619217642
- QA267 .S56 2006
| Item type | Current library | Call number | Copy number | Status | Barcode | |
|---|---|---|---|---|---|---|
| Books | Library First Floor | QA267 .S56 2006 (Browse shelf(Opens below)) | 2 | Available | 10230 | |
| Books | Library First Floor | QA267 .S56 2006 (Browse shelf(Opens below)) | 1 | Available | 10231 |
Browsing Library shelves, Shelving location: First Floor Close shelf browser (Hides shelf browser)
| QA267 .L49 1998 Elements of the theory of computation / Harry R. Lewis, Christos H. Papadimitriou. | QA267 .L49 1998 Elements of the theory of computation / Harry R. Lewis, Christos H. Papadimitriou. | QA267 .L49 1998 Elements of the theory of computation / | QA267 .S56 2006 Introduction to the theory of computation / | QA267 .S56 2006 Introduction to the theory of computation / | QA267.3 .L56 2001 An Introduction to Formal Languages and Automata / | QA267.3 .L56 2001 An Introduction to Formal Languages and Automata / |
"The content of this text differs from the US version" -- back cover.
Includes bibliographical references and index.
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.
This market leading text on computational theory provides a mathematical treatment of computer science theory designed around theorems and proofs.
There are no comments on this title.