Now you can clearly present even the most\n complex computational theory topics to your students with Sipser's distinct,\n market-leading INTRODUCTION TO THE THEORY OF COMPUTATION, 3E. The number one\n choice for today's computational theory course, this highly anticipated\n revision retains the unmatched clarity and thorough coverage that make it a\n leading text for upper-level undergraduate and introductory graduate\n students. This edition continues author Michael Sipser's well-known,\n approachable style with timely revisions, additional exercises, and more\n memorable examples in key areas. A new first-of-its-kind theoretical\n treatment of deterministic context-free languages is ideal for a better\n understanding of parsing and LR grammars. This edition's refined presentation\n ensures a trusted accuracy and clarity that make the challenging study of\n computational theory accessible and intuitive to students while maintaining\n the subject's rigor and formalism. Readers gain a solid understanding of the\n fundamental mathematical properties of computer hardware, software, and\n applications with a blend of practical and philosophical coverage and\n mathematical treatments, including advanced theorems and proofs. INTRODUCTION\n TO THE THEORY OF COMPUTATION, 3E, comprehensive coverage makes this an ideal\n ongoing reference tool for those studying theoretical computing. \n