Concise guide to computation theory / Akira Maruoka.
Material type:
TextPublication details: London ; New York : Springer, c2011.Description: xvii, 281 p. : illISBN: - 9780857295347 (alk. paper)
- 0857295349 (alk. paper)
| Item type | Current library | Collection | Call number | Status | Date due | Barcode | |
|---|---|---|---|---|---|---|---|
Books
|
Prof. Ram Dayal Munda Central Library, IGNTU Amarkantak M.P. | Computer Science | 004 MAR (Browse shelf(Opens below)) | Available | 56006 | ||
|
Books
|
Prof. Ram Dayal Munda Central Library, IGNTU Amarkantak M.P. | Computer Science | 004 MAR (Browse shelf(Opens below)) | Available | 56007 |
Includes bibliographical references (p. 275-276) and index.
Part I. The theory of computation -- 1. Everything begins with computation -- 2. Preliminaries to the theory of computation -- Part II. Automata and languages -- 3. Finite automata -- 4. Context-free languages -- 5. Pushdown automata -- Part III. Computability -- 6. Turing machine -- 7. Universality of Turing machine and its limitations -- Part IV. Complexity of computation -- 8. Computational complexity based on Turing machines -- 9. Computational complexity based on Boolean circuits -- 10. NP-completeness -- Part V. Conclusions and exercise solutions --11. Solutions -- 12. Concluding remarks.
There are no comments on this title.