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.
Features & Benefits
Provides a concise introduction to core topics taught in a single semester Theory of Computation or Automata Theory course.
Incorporates an engaging, student-friendly writing style and moves through material at a pace appropriate for undergraduate students.
A wide range of problems, varying in level of difficulty, allows students to test themselves on key material covered in the given chapter.
Ideal for an undergraduate course in the Theory of Computation offered within the Computer Science or Computer Engineering Departments.
Wayne Goddard-Clemson University
Wayne Goddard is currently as Associate Professor in the School of Computing at Clemson University having previously taught at the Universities of KwaZulu-Natal and Pennsylvania. His research interests are graph theory, algorithms, networks and combinatorics. He received his PhDs from the University of KwaZulu-Natal and the Massachusetts Institute of Technology. He has published over 100 journal and conference papers in many areas of graph theory as well as in graph algorithms, self-stabilizing algorithms, game-playing and ad hoc networks, and is co-author of a textbook on Research Methodology.