Problem Solving in Automata, Languages, and Complexity
Rights Contact Login For More Details
More About This Title Problem Solving in Automata, Languages, and Complexity
English
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.
English
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).
English
Preface.
Leverages.
Finite Automata.
Context-Free Languages.
Turing Machines.
Computability Theory.
Computational Complexity.
NP-Completeness.
References.
Index.
Leverages.
Finite Automata.
Context-Free Languages.
Turing Machines.
Computability Theory.
Computational Complexity.
NP-Completeness.
References.
Index.
English
"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)
