Problem Solving in Automata, Languages, and Complexity

Author: Ding-Zhu Du  

Publisher: John Wiley & Sons Inc‎

Publication year: 2004

E-ISBN: 9780471464082

P-ISBN(Hardback):  9780471439608

Subject: TP301.6 algorithm theory

Language: ENG

Access to resources Favorite

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Description

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.

Chapter

Contents

pp.:  6 – 8

Preface

pp.:  8 – 10

1 Regular Languages

pp.:  10 – 32

2 Finite Automata

pp.:  32 – 98

3 Context-Free Languages

pp.:  98 – 168

4 Turing Machines

pp.:  168 – 234

5 Computability Theory

pp.:  234 – 290

6 Computational Complexity

pp.:  290 – 332

7 NP-Completeness

pp.:  332 – 396

References

pp.:  396 – 398

Index

pp.:  398 – 406

The users who browse this book also browse