Skip to content

Theory of Computing A Gentle Introduction

Best in textbook rentals since 2012!

ISBN-10: 0130279617

ISBN-13: 9780130279613

Edition: 2001

Authors: Efim Kinber, Carl Smith

List price: $226.65
Blue ribbon 30 day, 100% satisfaction guarantee!
what's this?
Rush Rewards U
Members Receive:
Carrot Coin icon
XP icon
You have reached 400 XP and carrot coins. That is the daily max!

Description:

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.
Customers also bought

Book details

List price: $226.65
Copyright year: 2001
Publisher: Pearson Education
Publication date: 6/13/2000
Binding: Paperback
Pages: 224
Size: 7.00" wide x 8.90" long x 0.50" tall
Weight: 1.144

Carl Smith is the Franklyn Bliss Snyder Professor of English and American Studies and professor of history at Northwestern University. His books include three prize-winning volumes: Chicago and the American Literary Imagination, 1880-1920; Urban Disorder and the Shape of Belief: The Great Chicago Fire, the Haymarket Bomb, and the Model Town of Pullman; and The Plan of Chicago: Daniel Burnham and the Remaking of the American City, the latter two published by the University of Chicago Press.

Preface
Introduction
Why Study the Theory of Computing?
What Is Computation?
The Contents of This Book
Mathematical Preliminaries
Exercises
Finite Automata
Deterministic Finite Automata
Nondeterministic Finite Automata
Determinism versus Nondeterminism
Regular Expressions
Nonregular Languages
Algorithms for Finite Automata
The State Minimization Problem
Exercises
Context-Free Languages
Context-Free Grammars
Parsing
Pushdown Automata
Languages and Automata
Closure Properties
Languages That Are Not Context-Free
Chomsky Normal Form
Determinism
Exercises
Turing Machines
Definition of a Turing Machine
Computations by Turing Machines
Extensions of Turing Machines
Multiple Tapes
Multiple Heads
Two-Dimensional Tapes
Random Access Turing Machines
Nondeterministic Turing Machines
Turing Enumerable Languages
Exercises
Undecidability
The Church-Turing Thesis
Universal Turing Machines
The Halting Problem
Undecidable Problems
Exercises
Computational Complexity
The Definition and the Class P
The Class NP
NP-Completeness
Exercises
References
List of Symbols
Index