Theory of computation : by Michael Sipser.
Material type:
TextPublication details: New Delhi : Course Technology ; 2007cDescription: vi, 346 p. : ill. ; 24 cmISBN: 81 315 05138 (pbk)DDC classification: 511.352
Contents:
1. Introduction 11
2. PART ONE: Automata and Languages
2.1. Regular Language
2.2. Context-Free Languages
3. PART TWO: Computability Theory
3.1. The Church-Turing Thesis
3.2. Decidability
3.3. Reducibility
3.4. Advanced Topics in Comutability
-
PART THREE: COMPLEXITY THEORY
4.1. Time Complexity
4.2. Space Complexity
4.3. Intractability
4.4. Advanced topics in complexity theory
4.
| Item type | Current library | Call number | Copy number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|---|
Books
|
Namal Library Mathematics | 511.352 SIP-T 2007 2481 (Browse shelf (Opens below)) | 1 | Available | 0002481 | ||
|
Books
|
Namal Library Mathematics | 511.352 SIP-T 2007 2482 (Browse shelf (Opens below)) | 2 | Available | 0002482 | ||
|
Books
|
Namal Library Mathematics | 511.352 SIP-T 2007 2483 (Browse shelf (Opens below)) | 3 | Available | 0002483 | ||
|
Books
|
Namal Library Mathematics | 511.352 SIP-T 2007 2484 (Browse shelf (Opens below)) | 4 | Available | 0002484 | ||
|
Books
|
Namal Library Mathematics | 511.352 SIP-T 2007 2485 (Browse shelf (Opens below)) | 5 | Available | 0002485 | ||
|
Books
|
Namal Library Mathematics | 511.352 SIP-T 2007 2486 (Browse shelf (Opens below)) | 6 | Available | 0002486 | ||
|
Books
|
Namal Library Mathematics | 511.352 SIP-T 2007 2487 (Browse shelf (Opens below)) | 7 | Available | 0002487 | ||
|
Books
|
Namal Library Mathematics | 511.352 SIP-T 2007 2488 (Browse shelf (Opens below)) | 8 | Available | 0002488 | ||
| Reference | Namal Library Reference | 511.352 SIP-T 2007 1323 (Browse shelf (Opens below)) | 9 | Not for loan | 1323 |
Total holds: 0
Browsing Namal Library shelves, Shelving location: Mathematics Close shelf browser (Hides shelf browser)
|
|
|
|
|
|
|
||
| 511.352 SIP-T 2007 2483 Theory of computation : | 511.352 SIP-T 2007 2484 Theory of computation : | 511.352 SIP-T 2007 2485 Theory of computation : | 511.352 SIP-T 2007 2486 Theory of computation : | 511.352 SIP-T 2007 2487 Theory of computation : | 511.352 SIP-T 2007 2488 Theory of computation : | 511.4 KOW-S 1965 12015 Selected topics in approximation and computation / |
Index included.
1. Introduction 11
2. PART ONE: Automata and Languages
2.1. Regular Language
2.2. Context-Free Languages
3. PART TWO: Computability Theory
3.1. The Church-Turing Thesis
3.2. Decidability
3.3. Reducibility
3.4. Advanced Topics in Comutability
-
PART THREE: COMPLEXITY THEORY
4.1. Time Complexity
4.2. Space Complexity
4.3. Intractability
4.4. Advanced topics in complexity theory
4.
There are no comments on this title.