Introduction to the theory of computation /
Michael Sipser
- THIRD EDITION
- Australia : Cengage Learning Asia Pte Ltd, c2013
- xxii, 458 pages : illustrations ; 24 cm.
Includes bibliographical references and index.
Part one. Automata and language -- 1. Regular languages -- 2. Context-free languages -- Part two : Computability theory -- 3. The Church-Turing thesis -- 4. Decidability -- 5. Reducibility -- 6. Advanced topics in computability theory -- Part three : Complexity theory -- 7. Time complexity -- 8. Space complexity -- 9. Intractability -- 10. Advanced topics in complexity theory.
The third edition includes an entirely new section on deterministic context-free languages with connections to parsing and LR(k) grammars.