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. The number one choice for today’s computational theory course, this revision continues the book’s well-know, 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(k) 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, comprehensive coverage makes this a valuable reference for your continued studies in theoretical computing.
Part 1: Automata and Languages.
1. Regular Languages.
2. Context-Free Languages.
Part 2: Computability Theory.
3. The Church-Turing Thesis.
6. Advanced Topics in Computability Theory.
Part 3: Complexity Theory.
7. Time Complexity.
8. Space Complexity.
10. Advanced Topics in Complexity Theory.
113318779X | 9781133187790