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

Soporte

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
Métodos de pago

Tabla de materias

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

Sobre el autor

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

¡Compre este libro electrónico y obtenga 1 más GRATIS!
Idioma Inglés ● Formato PDF ● Páginas 408 ● ISBN 9780471464082 ● Tamaño de archivo 22.4 MB ● Editorial John Wiley & Sons ● Publicado 2004 ● Edición 1 ● Descargable 24 meses ● Divisa EUR ● ID 2328398 ● Protección de copia Adobe DRM
Requiere lector de ebook con capacidad DRM

Más ebooks del mismo autor / Editor

929 Ebooks en esta categoría