Introduction to the theory of computation / Michael Sipser.
Material type:
TextPublisher: Boston, MA : Cengage Learning, c2013Edition: 3rd edDescription: xxii, 458 p. : ill. ; 24 cmISBN: 9781133187790; 113318779XSubject(s): Théorie des automates | Complexité de calcul (Informatique) | Machine theory | Computational complexity | Automates mathématiques, Théorie des | Complexité de calcul (informatique) | Informatique -- Modèles mathématiques | Turing, Machines de | Décidabilité (logique mathématique) | Computational complexity | Machine theoryDDC classification: 511.3 LOC classification: QA267 | .S56 2013| Item type | Current library | Call number | Copy number | Status | Notes | Date due | Barcode |
|---|---|---|---|---|---|---|---|
Books
|
Main Library | QA267 .S56 2013 (Browse shelf (Opens below)) | 1 | Available | STACKS | 51952000206521 |
Browsing Main Library shelves Close shelf browser
|
|
|
|
|
|
|
||
| QA267 .K69 1997 Automata and computability / | QA267 .R53 2008 Automata, computability and complexity : theory and applications / | QA267 .S56 2006 Introduction to the theory of computation / | QA267 .S56 2013 Introduction to the theory of computation / | QA267.3 .L56 2006 An introduction to formal languages and automata / | QA267.3 .S53 2009 A second course in formal languages and automata theory / | QA267.5 .S4 M29 2011 Introduction to languages and the theory of computation / |
Bibliogr.: p. 443-447.
1. Regular languages -- 2. Context-free languages -- 3. The Church-Turing thesis -- 4. Decidability -- 5. Reducibility -- 6. Advanced topics in computability theory -- 7. Time complexity -- 8. Space complexity -- 9. Interactibility -- 10. Advanced topics in complexity theory.
1
There are no comments on this title.