Concise guide to computation theory
著者
書誌事項
Concise guide to computation theory
Springer, c2011
大学図書館所蔵 件 / 全10件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references (p. 273-276) and index
内容説明・目次
内容説明
This 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.
目次
Part I: The Theory of Computation
Everything Begins With Computation
Preliminaries to the Theory of Computation
Part II: Automata and Languages
Finite Automata
Context-Free Languages
Pushdown Automaton
Part III: Computability
Turing Machine
Universality of Turing Machine and its Limitation
Part IV: Complexity of Computation
Computational Complexity Based on Turing Machines
Computational Complexity Based on Boolean Circuits
NP-Completeness
Solutions
Concluding Remarks
「Nielsen BookData」 より