Introduction to the theory of computation / Michael Sipser.
Material type:
TextPublication details: Boston : PWS Pub. Co., c1997Edition: 1st edDescription: xv, 396 p. : ill. ; 25 cmISBN: - 9812402268
- 053494728X
- 511.3 SII
Books
| Item type | Current library | Collection | Shelving location | Call number | Copy number | Status | Date due | Barcode | |
|---|---|---|---|---|---|---|---|---|---|
|
Books
|
KU Central Library | Rack No. : 16 Annex : 01 Shelve No. : A-01 | Reference Section (Non-Issuable Books) | 511.3 SII 1997 (Browse shelf(Opens below)) | C-1 (NI) | Not For Loan | 54688 |
Browsing KU Central Library shelves Close shelf browser (Hides shelf browser)
| 511 ROD 2022 Discrete mathematics and its applications / | 511 ROD 2022 Discrete mathematics and its applications / | 511.3 MAR 2003 Introduction to languages and the theory of computation / | 511.3 SII 1997 Introduction to the theory of computation / | 511.5 GRG 2022 Graph theory and its applications / | 511.5 GRG 2022 Graph theory and its applications / | 511.6 STD 2011 Discrete Mathematics for Computer Scientists / |
Includes bibliographical references and indexes.
Preface
Introduction
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
Michael Sipser's emphasis on unifying computer science theory - rather than offering a collection of low-level details - sets the book apart, as do his intuitive explanations. Throughout the book, Sipser builds students' knowledge of conceptual tools used in computer science, the aesthetic sense they need to create elegant systems, and the ability to think through problems on their own
There are no comments on this title.
Click on an image to view it in the image viewer