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

Ajutor

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
Metode de plata

Cuprins

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

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

Cumpărați această carte electronică și primiți încă 1 GRATUIT!
Limba Engleză ● Format PDF ● Pagini 408 ● ISBN 9780471464082 ● Mărime fișier 22.4 MB ● Editura John Wiley & Sons ● Publicat 2004 ● Ediție 1 ● Descărcabil 24 luni ● Valută EUR ● ID 2328398 ● Protecție împotriva copiilor Adobe DRM
Necesită un cititor de ebook capabil de DRM

Mai multe cărți electronice de la același autor (i) / Editor

849 Ebooks din această categorie