Stock image for illustration purposes only - book cover, edition or condition may vary.
Problem Solving in Automata, Languages and Complexity
Ding-Zhu Du
€ 187.72
FREE Delivery in Ireland
Description for Problem Solving in Automata, Languages and Complexity
Hardcover. Language theory, automata, and complexity theory are essential topics in the field of computer science. In this volume, two established experts offer practical, accessible coverage of these issues with an emphasis on problem-solving skills. Num Pages: 408 pages, Ill. BIC Classification: UYQL. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 244 x 164 x 28. Weight in Grams: 736.
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.
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.
Product Details
Publisher
John Wiley and Sons Ltd United States
Number of pages
408
Format
Hardback
Publication date
2001
Condition
New
Weight
777g
Number of Pages
408
Place of Publication
, United States
ISBN
9780471439608
SKU
V9780471439608
Shipping Time
Usually ships in 7 to 11 working days
Ref
99-50
About Ding-Zhu Du
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).
Reviews for Problem Solving in Automata, Languages and Complexity
"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)