Problem Solving in Automata, Languages, and Complexity (Hardcover)

Ding-Zhu Du

ISBN 10: 0471439606 / ISBN 13: 9780471439608

Published by John Wiley & Sons Inc, New York, 2001

About this Item

Hardcover. 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. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Seller Inventory # 9780471439608

Bibliographic Details

• Title: Problem Solving in Automata, Languages, and Complexity (Hardcover)
• Publisher: John Wiley & Sons Inc, New York
• Publication Date: 2001
• Language: English
• ISBN 10: 0471439606
• ISBN 13: 9780471439608
• Binding: Hardcover
• Edition: 1st Edition
• Condition: new

About this title

Synopsis

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.

About the Author

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).