Introducing the Theory of Computation / Edition 1

by Wayne Goddard

Overview

Introducing the Theory of Computation is the ideal text for an undergraduate course in the Theory of Computation or Automata Theory. The text covers the standard three models of finite automata, grammars, and Turing machines, as well as undecidability and an introduction to complexity theory. Solutions for selected exercises are included as an appendix.

Product Details

ISBN-13:	2900763741258
Publisher:	Jones & Bartlett Learning
Publication date:	02/12/2008
Edition description:	1E
Pages:	228
Product dimensions:	6.00(w) x 1.25(h) x 9.00(d)

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.