
Problem Solving in Automata, Languages, and Complexity
Wiley (Publisher)
1st Edition
Published on 24. October 2001
Book
Hardback
X, 398 pages
978-0-471-43960-8 (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 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) ".uses a problem-solving approach that makes these computer languages concrete." (SciTech Book News, Vol. 25, No. 4, December 2001)More details
Product info
GB
Edition
1., Auflage
Language
English
Place of publication
United States
Publishing group
John Wiley & Sons Inc
Target group
College/higher education
Professional and scholarly
Product notice
sewn/stitched
Cloth over boards
Dimensions
Height: 240 mm
Width: 161 mm
Thickness: 26 mm
Weight
777 gr
ISBN-13
978-0-471-43960-8 (9780471439608)
Schweitzer Classification
Other editions
Additional editions

Ding-Zhu Du | Ker-I Ko
Problem Solving in Automata, Languages, and Complexity
E-Book
03/2004
Wiley
€147.99
Available for download
Persons
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).
Content
Preface.
Leverages.
Finite Automata.
Context-Free Languages.
Turing Machines.
Computability Theory.
Computational Complexity.
NP-Completeness.
References.
Index.