Introduction to the Theory of Computation
- ISBN-10
- 113318779X
- ISBN-13
- 9781133187790
- Series
- Introduction to the Theory of Computation
- Category
- Computers
- Pages
- 504
- Language
- English
- Published
- 2012-06-27
- Publisher
- Cengage Learning
- Author
- Michael Sipser
Description
Now you can clearly present even the most complex computational theory topics to your students with Sipser’s distinct, market-leading INTRODUCTION TO THE THEORY OF COMPUTATION, 3E. The number one choice for today’s computational theory course, this highly anticipated revision retains the unmatched clarity and thorough coverage that make it a leading text for upper-level undergraduate and introductory graduate students. This edition continues author Michael Sipser’s well-known, approachable style with timely revisions, additional exercises, and more memorable examples in key areas. A new first-of-its-kind theoretical treatment of deterministic context-free languages is ideal for a better understanding of parsing and LR(k) grammars. This edition’s refined presentation ensures a trusted accuracy and clarity that make the challenging study of computational theory accessible and intuitive to students while maintaining the subject’s rigor and formalism. Readers gain a solid understanding of the fundamental mathematical properties of computer hardware, software, and applications with a blend of practical and philosophical coverage and mathematical treatments, including advanced theorems and proofs. INTRODUCTION TO THE THEORY OF COMPUTATION, 3E’s comprehensive coverage makes this an ideal ongoing reference tool for those studying theoretical computing. Important Notice: Media content referenced within the product description or the product text may not be available in the ebook version.
Get the book
Other editions
Similar books
-
Introduction to the Theory of Computation
By Michael Sipser"Intended as an upper-level undergraduate or introductory graduate text in computer science theory," this book lucidly covers the key concepts and theorems of the theory of computation.
-
Introduction to Languages and the Theory of Computation
By John C. MartinA distinctive feature of this text is its gentle and gradual introduction of the necessary mathematical tools in the context in which they are used.
-
Introduction to Automata Theory, Formal Languages and Computation
By Shyamalendu KandarFormal languages and automata theory is the study of abstract machines and how these can be used for solving problems. The book has a simple and exhaustive approach to topics like automata theory, formal languages and theory of computation.
-
Computability and Complexity: From a Programming Perspective
By Neil D. JonesNew results in the book include a proof that constant time factors do matter for its programming-oriented model of computation. (In contrast, Turing machines have a counterintuitive "constant speedup" property: that almost any program can ...
-
Theory of Computation
By Dexter C. KozenThe book contains an invaluable collection of lectures for first-year graduates on the theory of computation. Topics and features include more than 40 lectures for first year graduate students, and a dozen homework sets and exercises.
-
Computational Complexity: A Modern Approach
By Sanjeev Arora, Boaz BarakNew and classical results in computational complexity, including interactive proofs, PCP, derandomization, and quantum computation. Ideal for graduate students.
-
Introduction To The Theory Of Neural Computation
By John A. HertzIn each group of the intermediate layer the four units learn to respond to three vertical, or three horizontal lines. The output layer learns the correlations between the two groups in the intermediate layer, which normally leads to ...
-
Theory of Computer Science: Automata, Languages and Computation
By K. L. P. Mishra, N. CHANDRASEKARANThis Third Edition, in response to the enthusiastic reception given by academia and students to the previous edition, offers a cohesive presentation of all aspects of theoretical computer science, namely automata, formal languages, ...
-
Limits of Computation: An Introduction to the Undecidable and the Intractable
By Edna E. Reiter, Clayton Matthew Johnsonbecomes “Given this chess board and a suggested move, can White force a win by making this move?” In all cases that we will use, there are an infinite number of possible inputs, which are divided into the yes instances and the no ...
-
Programs and Machines: An Introduction to the Theory of Computation
By Richard BirdPrograms and Machines: An Introduction to the Theory of Computation