Introducing the Theory of Computation is the ideal text for 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 and programming exercises, varying in level of difficulty, round out each chapter and allow students to test themselves on key topics.

About the Author:

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.

"About this title" may belong to another edition of this title.

Store Description

We love books and pride ourselves of giving the customer the best buying experience.

Visit Seller's Storefront