EVERYDAY FREE SHIPPING on $25 & up - Excludes Marketplace items.
EVERYDAY FREE SHIPPING on $25 & up - Excludes Marketplace items.
EVERYDAY FREE SHIPPING on $25 & up - Excludes marketplace items.
Search
Theory of Computing : A Gentle Introduction

Theory of Computing : A Gentle Introduction - 01 edition

ISBN13: 978-0130279613

Cover of Theory of Computing : A Gentle Introduction 01 (ISBN 978-0130279613)
ISBN13: 978-0130279613
ISBN10: 0130279617
Cover type: Hardback
Edition/Copyright: 01
Publisher: Prentice Hall, Inc.
Published: 2001
International: No
Sell this book right now for CASH!
Sell this book
right now for
$14.50 CASH!

List price: $194.75

More Shipping Options

Theory of Computing : A Gentle Introduction - 01 edition

ISBN13: 978-0130279613

Efim Kinber and Carl H. Smith

ISBN13: 978-0130279613
ISBN10: 0130279617
Cover type: Hardback
Edition/Copyright: 01
Publisher: Prentice Hall, Inc.

Published: 2001
International: No
Summary

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. Teaches the fundamental concepts behind computation. Hundreds of exercises marked according to the level of difficulty provide readers ample opportunity to apply concepts. Hundreds of illustrations which enhance understanding. Only algorithmic proofs are given in the text allowing readers to calibrate the mathematical depth they want to pursue. Appropriate for upper division undergraduate and graduate level courses in Computer Science Theory, Theory of Computation, and Automata and Formal Language Theory.

Table of Contents

(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.

More Shipping Options