Introduction to the theory of computation / by Michael Sipser
Material type:
TextPublication details: New Delhi : Cengage Learning Private Limited, 2012, 2006cEdition: 2nd edDescription: xiii, 427 p. ; ill, : 24 cmISBN: 9788131517505(pbk); 8131517500(pbk)Subject(s): Machine theoryDDC classification: 511.3
Contents:
Pt. 1. Automata and languages. Regular languages ; Context-free languages -- Pt. 2. Computability theory. The Church-Turing thesis ; Decidability ; Reducibility ; Advanced topics in computability theory -- Pt. 3. Complexity theory. Time complexity ; Space complexity ; Intractability ; Advanced topics in complexity theory.
| Item type | Current library | Call number | Copy number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|---|
| Reference | Namal Library Reference | 511.3 SID-I 2012 283 (Browse shelf (Opens below)) | 1 | Not for loan | 283 | ||
Books
|
Namal Library Mathematics | 511.3 SID-I 2012 285 (Browse shelf (Opens below)) | 3 | Available | 285 | ||
|
Books
|
Namal Library Mathematics | 511.3 SID-I 2012 286 (Browse shelf (Opens below)) | 4 | Available | 286 | ||
|
Books
|
Namal Library Reference | 511.3 SID-I 2012 552 (Browse shelf (Opens below)) | 6 | Available | 552 | ||
|
Books
|
Namal Library Mathematics | 511.3 SID-I 2012 284 (Browse shelf (Opens below)) | 2 | Available | 284 | ||
|
Books
|
Namal Library Mathematics | 511.3 SID-I 2012 3751 (Browse shelf (Opens below)) | c.7 | Available | 0003751 |
Total holds: 0
Browsing Namal Library shelves, Shelving location: Reference Close shelf browser (Hides shelf browser)
|
|
|
|
|
|
|
||
| 510 TAN-C 2002 1341 College mathematics : | 510 WOO-A 2005 1325 Advanced maths A2 core for edexcel / | 511.3 FIS-A 2011 8983 An introduction to practical formal methods using temporal logic | 511.3 SID-I 2012 283 Introduction to the theory of computation | 511.3 SID-I 2012 552 Introduction to the theory of computation | 511.352 SIP-T 2007 1323 Theory of computation : | 511.8 NEA-F 2011 604 Foundations of algorithms / |
Include bibliography references and index
Pt. 1. Automata and languages. Regular languages ; Context-free languages -- Pt. 2. Computability theory. The Church-Turing thesis ; Decidability ; Reducibility ; Advanced topics in computability theory -- Pt. 3. Complexity theory. Time complexity ; Space complexity ; Intractability ; Advanced topics in complexity theory.
There are no comments on this title.