| 000 | 01829nam a2200229Ia 4500 | ||
|---|---|---|---|
| 003 | NULRC | ||
| 005 | 20250520102659.0 | ||
| 008 | 250520s9999 xx 000 0 und d | ||
| 020 | _a9780857295347 | ||
| 040 | _cNULRC | ||
| 050 | _aQA 267.7 .M37 2011 | ||
| 100 |
_aMaruoka, Akira _eauthor |
||
| 245 | 0 |
_aConcise guide to computation theory / _cAkira Maruoka |
|
| 260 |
_aLondon, United Kingdom : _bSpringer-Verlag, _cc2011 |
||
| 300 |
_axvii, 281 pages : _billustrations ; _c25 cm.USD |
||
| 365 | _bUSD49.7 | ||
| 504 | _aIncludes bibliographical references and index. | ||
| 505 | _apt. 1. The theory of computation -- pt. 2. Automata and languages -- pt. 3. Computability -- pt. 4. Complexity of computation -- pt. 5. Conclusions and exercise solutions. | ||
| 520 | _aThis textbook presents a thorough foundation to the theory of computation. Combining intuitive descriptions and illustrations with rigorous arguments and detailed proofs for key topics, the logically structured discussion guides the reader through the core concepts of automata and languages, computability, and complexity of computation. Topics and features: presents a detailed introduction to the theory of computation, complete with concise explanations of the mathematical prerequisites; provides end-of-chapter problems with solutions, in addition to chapter-opening summaries and numerous examples and definitions throughout the text; draws upon the author’s extensive teaching experience and broad research interests; discusses finite automata, context-free languages, and pushdown automata; examines the concept, universality and limitations of the Turing machine; investigates computational complexity based on Turing machines and Boolean circuits, as well as the notion of NP-completeness. | ||
| 650 | _aCOMPUTER SCIENCE | ||
| 942 |
_2lcc _cBK |
||
| 999 |
_c12961 _d12961 |
||