TY  - BOOK
AU  - Sipser,Michael
TI  - Introduction to the theory of computation
SN  - 9781133187813
AV  - QA267 .S56 2006
U1  - 511.35 SI.I 2013 23
PY  - 2013///
CY  - Australia : 
PB  - Cengage Learning, 
KW  - Machine theory
KW  - Computational complexity
N1  - Includes bibliographical references (pages 443-447) and index;  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.  Interactibility --  10.  Advanced topics in complexity theory
N2  - Clearly present even the most complex computational theory topics to your students using Sipser's textbook. This updated edition continues Sipser's approachable style with timely revisions, additional exercises, and more memorable examples in key areas. $b Gain a clear understanding of even the most complex, highly theoretical computational theory topics in the approachable presentation found only in the market-leading INTRODUCTION TO THE THEORY OF COMPUTATION, 3E, International Edition. The number one choice for today's computational theory course, this revision continues the book's well-known, approachable style with timely revisions, additional practice, 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. You 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 a valuable reference for your continued studies in theoretical computing
ER  -