Academic book request
In order to decide if a book might be suitable for your course we know that you need to look at it in detail.
If you are an academic teaching a course of 12 or more students you can choose up to three complimentary inspection copies of textbooks that are applicable to the courses that you teach.
To request your inspection copies, please complete the form below.
Introducing the Theory of ComputationAuthor: Wayne Goddard
Introducing the Theory of Computation is the ideal text for any undergraduate, introductory course on formal languages, automata, and computability. The author provides a concise, yet complete introduction to the important models of finite automata, grammars, and Turing machines, as well as undecidability and the basics of complexity theory. Numerous problems, varying in level of difficulty, round out each chapter and allow students to test themselves on key topics. Answers to selected exercises are included as an appendix and a complete instructor’s solutions manual is available on the text’s website.
TABLE OF CONTENTS
1. Finite Automata
2. Regular Expressions
4. Properties of Regular Languages
5. Applications of Finite Automata
Part II: Context-Free Languages
6. Context-Free Grammars
7. Pushdown Automata
8. Grammars and Equivalencies
9. Properties of Context-free Languages
10. Deterministic Parsing
Part III: Turing Machines
11. Turing Machines
12. Variations of Turning Machines
13. Decidable Problems and Recursive Languages
Part IV: Undecidability
14. Diagonalization and the Halting Problem
15. More Undecidable Problems
16. Recursive Functions
Part V: Complexity Theory
17. Time Complexity
18. Space Complexity