
Problem Solving in Automata, Languages & Complexity
D. Du(Author)
Preservation Press,U.S.
Published on 18. February 2002
Software
Other digital
408 pages
978-0-471-22464-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)More details
Language
English
Place of publication
New York
United States
Publishing group
John Wiley & Sons Inc
Target group
Professional and scholarly
Dimensions
Height: 284 mm
Width: 214 mm
Thickness: 17 mm
Weight
1000 gr
ISBN-13
978-0-471-22464-8 (9780471224648)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
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
Person
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.