/LC.GIF&client=easterncarolinaedu)
Concise guide to computation theory / Akira Maruoka.
| Author/creator | Maruoka, Akira |
| Format | Electronic |
| Publication Info | London ; New York : Springer, |
| Description | xvii, 281 p. : ill. ; 24 cm. |
| Supplemental Content | Full text available from Springer Books |
| Supplemental Content | Full text available from Springer Nature - Springer Computer Science eBooks 2011 English International |
| Subjects |
| Contents | 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. |
| Bibliography note | Includes bibliographical references (p. 275-276) and index. |
| Access restriction | Available only to authorized users. |
| Technical details | Mode of access: World Wide Web |
| Genre/form | Electronic books. |
| LCCN | 2011927846 |
| ISBN | 9780857295347 (alk. paper) |
| ISBN | 0857295349 (alk. paper) |
Availability
| Library | Location | Call Number | Status | Item Actions |
|---|---|---|---|---|
| Electronic Resources | ✔ Available |