Theory of computing : a gentle introduction
著者
書誌事項
Theory of computing : a gentle introduction
Prentice Hall, 2001
大学図書館所蔵 件 / 全9件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references (p. 199) and index
内容説明・目次
内容説明
Appropriate for upper division undergraduate and graduate level courses in Computer Science Theory, Theory of Computation, and Automata and Formal Language Theory. This book focuses on fundamental issues of computation. The readers can master the content and gain lasting perspective from which to understand computers by carefully worked out examples, illustrations, and algorithmic proofs. It is especially appropriate for one-term courses.
目次
(NOTE: Each chapter concludes with Exercises.)
1. Introduction.
Why Study the Theory of Computing? What Is Computation? The Contents of This Book. Mathematical Preliminaries.
2. Finite Automata.
Deterministic Finite Automata. Nondeterministic Finite Automata. Determinism versus Nondeterminism. Regular Expressions. Nonregular Languages. Algorithms for Finite Automata. The State Minimization Problem.
3. Context Free Languages.
Context-Free Grammars. Parsing. Pushdown Automata. Languages and Automata. Closure Properties. Languages That Are Not Context-Free. Chomsky Normal Form. Determinism.
4. Turing Machines.
Definition of a Turing Machine. Computations by Turing Machines. Extensions of Turing Machines. Nondeterministic Turing Machines. Turing Enumerable Languages.
5. Undecidability.
The Church-Turing Thesis. Universal Turing Machines. The Halting Problem. Undecidable Problems.
6. Computational Complexity.
The Definition and the Class P. The Class N P. N P-Completeness.
References.
List of Symbols.
Index.
「Nielsen BookData」 より
