Introduction to the theory of computation / Michael Sipser.
By: Sipser, Michael
.
Publisher: Boston, Mass. : Thomson/Course Technology, c2006Edition: 2nd ed., Int ed.Description: xvii, 437 p. : ill. ; 24 cm.ISBN: 0619217642.Subject(s): Machine theory | Computational complexityDDC classification: 511.3
Contents:
Part One: Automato and languages: 1. Regular languages - 2. Context-free languages -- Part two: Computability theory: 3. The church-turing thesis - 4. Decidability - 5. Reducibility - 6. Advanced topics in computability theory -- Part three: Complexity theory: 7. Time complexity - 8. Space Complexity - 9. Intractability - 10. Advanced topics in complexity theory.
| Item type | Current location | Call number | Copy number | Status | Notes | Date due | Barcode |
|---|---|---|---|---|---|---|---|
| Main Collection | Taylor's Library-TU | 511.3 SIP (Browse shelf) | 1 | Available | SOCIT,15010,02,GR | 5000097229 |
Browsing Taylor's Library-TU Shelves Close shelf browser
| 511.3 ROT Journey into mathematics : | 511.3 SHO Mathematical logic / | 511.3 SIP Introduction to the theory of computation / | 511.3 SIP Introduction to the theory of computation / | 511.3 SUD Languages and machines : | 511.3 SUD Languages and machines : | 511.3 SUD Languages and machines : |
Includes bibliographical references (p. 421-425) and index.
Part One: Automato and languages: 1. Regular languages - 2. Context-free languages -- Part two: Computability theory: 3. The church-turing thesis - 4. Decidability - 5. Reducibility - 6. Advanced topics in computability theory -- Part three: Complexity theory: 7. Time complexity - 8. Space Complexity - 9. Intractability - 10. Advanced topics in complexity theory.