Efim Kinber,
Carl Smith
Theory of Computing
A Gentle Introduction
Paperback Engels 2000 9780130279613Niet leverbaar.
Samenvatting
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.
Specificaties
ISBN13:9780130279613
Taal:Engels
Bindwijze:Paperback
Aantal pagina's:224
Uitgever:Pearson Education (US)
Lezersrecensies
Wees de eerste die een lezersrecensie schrijft!
Inhoudsopgave
(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.
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.
€ 209,81
Rubrieken
- advisering
- algemeen management
- coaching en trainen
- communicatie en media
- economie
- financieel management
- inkoop en logistiek
- internet en social media
- it-management / ict
- juridisch
- leiderschap
- marketing
- mens en maatschappij
- non-profit
- ondernemen
- organisatiekunde
- personal finance
- personeelsmanagement
- persoonlijke effectiviteit
- projectmanagement
- psychologie
- reclame en verkoop
- strategisch management
- verandermanagement
- werk en loopbaan