Problem Solving in Automata, Languages, and Complexity / Edition 1

Problem Solving in Automata, Languages, and Complexity / Edition 1

by Ding-Zhu Du, Ker-I Ko
     
 

ISBN-10: 0471439606

ISBN-13: 9780471439608

Pub. Date: 10/03/2001

Publisher: Wiley

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.

…  See more details below

Overview

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.

Product Details

ISBN-13:
9780471439608
Publisher:
Wiley
Publication date:
10/03/2001
Edition description:
New Edition
Pages:
408
Product dimensions:
6.38(w) x 9.43(h) x 0.96(d)

Table of Contents

Preface.

Leverages.

Finite Automata.

Context-Free Languages.

Turing Machines.

Computability Theory.

Computational Complexity.

NP-Completeness.

References.

Index.

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >