Ding-Zhu Du & Ker-I Ko 
Problem Solving in Automata, Languages, and Complexity [PDF ebook] 

Support

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.

€147.99
payment methods

Table of Content

Preface.
Leverages.
Finite Automata.
Context-Free Languages.
Turing Machines.
Computability Theory.
Computational Complexity.
NP-Completeness.
References.
Index.

About the author

DING-ZHU DU, Ph D, is Professor of Computer Science at the University of Minnesota.
KER-I KO, Ph D, 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).

Buy this ebook and get 1 more FREE!
Language English ● Format PDF ● Pages 408 ● ISBN 9780471464082 ● File size 22.4 MB ● Publisher John Wiley & Sons ● Published 2004 ● Edition 1 ● Downloadable 24 months ● Currency EUR ● ID 2328398 ● Copy protection Adobe DRM
Requires a DRM capable ebook reader

More ebooks from the same author(s) / Editor

929 Ebooks in this category