Problem Solving in Automata,Languages,and Complexity
Ding-Zhu Du, Ker-I KoBooks.org participates in affiliate programs including Bookshop.org and the Amazon Services LLC Associates Program. We may earn a commission from qualifying purchases made through links on this page, at no additional cost to you.
Overview
Automata and natural language theory are topics lying at the heart of computer science. Both are linked to computational complexity and together, these disciplines help define the parameters of what constitutes a computer, the structure of programs, which problems are solvable by computers, and a range of other crucial aspects of the practice of computer science. In this important volume, two respected authors/editors in the field offer accessible, practice-oriented coverage of these issues with an emphasis on refining core problem solving skills.Synopsis
Designed for undergraduate and graduate computer science courses, the text uses a problem-solving approach that makes these computer languages concrete. The basic theoretical topics are covered: finite-state automata, context-free grammars, Turing machines, recursive and recursively enumerable languages, complexity classes, and NP-completeness. Du and Ko teach computer science at the U. of Minnesota and the State U. of New York at Stony Brook, respectively.
Annotation c. Book News, Inc., Portland, OR (booknews.com)
Editorials
From the Publisher
"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)