Problem Solving in Automata, Languages, and Complexity
Published on 22. March 2004
408 pages
978-0-471-46408-2 (ISBN)
Description
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.
Reviews / Votes
"Its notional richness, while challenging, when combined with theinstructional narrative is quite engaging-I found myself drawn intothe text..." (IEEE Circuits & Devices, July/August2004) "...uses a problem-solving approach that makes these computerlanguages concrete..." (SciTech Book News, Vol. 25, No. 4,December 2001)More details
Other editions
Additional editions
Software
02/2002
Preservation Press,U.S.
€140.44
No shipping information available
Ding-Zhu Du | Ker-I Ko
Problem Solving in Automata, Languages, and Complexity
Book
10/2001
1st Edition
Wiley
€174.50
Shipment within 10-20 days
Persons
DING-ZHU DU, PhD, is Professor of Computer Science at theUniversity of Minnesota.
KER-I KO, PhD, is Professor of Computer Science at the StateUniversity of New York at Stony Brook. The two are also coauthorsof Theory of Computational Complexity (Wiley).
Content
Preface.
Leverages.
Finite Automata.
Context-Free Languages.
Turing Machines.
Computability Theory.
Computational Complexity.
NP-Completeness.
References.
Index.
