Introduction to the theory of computation / Michael Sipser.
Material type: TextPublication details: New Delhi. Cengage Learning; 2013.Edition: 3rd ed. 2013Description: vi-458 p. softbound 15x24cmISBN:- 978-81-315-2529-6
- 23 511.35 SIP
Contents:
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.
Item type | Current library | Collection | Call number | Status | Date due | Barcode | |
---|---|---|---|---|---|---|---|
Books | Tetso College Library Science and Technology | Non-fiction | 511.35 SIP (Browse shelf(Opens below)) | Available | 10547 | ||
Books | Tetso College Library Science and Technology | Non-fiction | 511.35 SIP (Browse shelf(Opens below)) | Available | 10552 |
Browsing Tetso College Library shelves, Shelving location: Science and Technology, Collection: Non-fiction Close shelf browser (Hides shelf browser)
511 LIU Elements of Discrete Mathematics A Computer Oriented Approach | 511.35 MAR Introduction to Language and the Theory of Computation | 511.35 SIP Introduction to the theory of computation / | 511.35 SIP Introduction to the theory of computation / | 511.5 AAG Laboratory Manual Mathematics / | 511.7028542 RAJ Computer oriented numerical methods./ | 511.8 MEH Mathematics For Economists |
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.
There are no comments on this title.
Log in to your account to post a comment.