Problem Solving in Automata, Languages, and Complexity

Front Cover
John Wiley & Sons, Apr 5, 2004 - Computers - 408 pages
2 Reviews
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.
 

What people are saying - Write a review

User Review - Flag as inappropriate

Better examples than most books about automata, including Hopcroft's.

Contents

1 Regular Languages
1
2 Finite Automata
23
3 ContextFree Languages
89
4 Turing Machines
159
5 Computability Theory
225
6 Computational Complexity
281
7 NPCompleteness
323
References
387
Index
389
Copyright

Other editions - View all

Common terms and phrases

About the author (2004)

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

Bibliographic information