Now you can clearly present even the most complex computational theory topicsto your students with Sipser's distinct, market-leading INTRODUCTION TO THE THEORY OF COMPUTATION, 3E, International Edition. The number one choice for today's computational theory course, this highly anticipated revision retains theunmatched 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 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, International Edition's comprehensive coverage makes this an ideal ongoing reference tool for those studying theoretical computing. INDICE: Introduction.PART 1: AUTOMATA AND LANGUAGES.1. Regular Languages.2. Context-Free Languages.PART 2: COMPUTABILITY THEORY.3. The Church-Turing Thesis.4. Decidability.5. Reducibility.6. Advanced Topics in Computability Theory.PART 3: COMPLEXITY THEORY.7. Time Complexity.8. Space Complexity.9. Intractability.10. Advanced Topics in Complexity Theory.Selected Bibliography.
- ISBN: 978-1-133-18781-3
- Editorial: Cengage Learning
- Encuadernacion: Rústica
- Páginas: 504
- Fecha Publicación: 26/09/2012
- Nº Volúmenes: 1
- Idioma: Inglés