Concise guide to computation theory Akira Maruoka

By: Maruoka, AkiraPublication details: London Springer 2011Description: xvii, 281 pages : illustrationsISBN: 9780857295347; 0857295349 (alk. paper)Subject(s): COMPUTATIONAL COMPLEXITY | COMPUTABLE FUNCTIONS | MACHINE THEORYLOC classification: QA 267.7 Mar
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.
Tags from this library: No tags from this library for this title.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Home library Call number Materials specified Status Date due Barcode
MONOGRAPH MONOGRAPH CBU-MAIN LIBRARY, KITWE.
QA 267.7 Mar (Browse shelf(Opens below)) Available 749035

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.

to post a comment.