DING-ZHU DU, PhD, is Professor of Computer Science at the University of Minnesota. KER-I KO, PhD, is Professor of Computer Science at the State University of New York at Stony Brook. The two are also coauthors of Theory of Computational Complexity (Wiley).

"Its notional richness, while challenging, when combined with the instructional narrative is quite engaging-I found myself drawn into the text…" (IEEE Circuits & Devices, July/August 2004) "...uses a problem-solving approach that makes these computer languages concrete..." (SciTech Book News, Vol. 25, No. 4, December 2001)

• Preface. Leverages. Finite Automata. Context-Free Languages. Turing Machines. Computability Theory. Computational Complexity. NP-Completeness. References. Index.

DING-ZHU DU, PhD, is Professor of Computer Science at the University of Minnesota. KER-I KO, PhD, is Professor of Computer Science at the State University of New York at Stony Brook. The two are also coauthors of Theory of Computational Complexity (Wiley).

"Its notional richness, while challenging, when combined with the instructional narrative is quite engaging-I found myself drawn into the text…" (IEEE Circuits & Devices, July/August 2004) "...uses a problem-solving approach that makes these computer languages concrete..." (SciTech Book News, Vol. 25, No. 4, December 2001)

• Preface. Leverages. Finite Automata. Context-Free Languages. Turing Machines. Computability Theory. Computational Complexity. NP-Completeness. References. Index.

DING-ZHU DU, PhD, is Professor of Computer Science at the University of Minnesota. KER-I KO, PhD, is Professor of Computer Science at the State University of New York at Stony Brook. The two are also coauthors of Theory of Computational Complexity (Wiley).

"Its notional richness, while challenging, when combined with the instructional narrative is quite engaging-I found myself drawn into the text…" (IEEE Circuits & Devices, July/August 2004) "...uses a problem-solving approach that makes these computer languages concrete..." (SciTech Book News, Vol. 25, No. 4, December 2001)

• Preface. Leverages. Finite Automata. Context-Free Languages. Turing Machines. Computability Theory. Computational Complexity. NP-Completeness. References. Index.