Problem Solving in Automata, Languages, and Complexity

Inbunden, Engelska, 2001

2 045 kr

Beställningsvara. Skickas inom 5-8 vardagar. Fri frakt över 249 kr.

Beskrivning

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.

Produktinformation

Utgivningsdatum:2001-10-24
Mått:162 x 240 x 24 mm
Vikt:687 g
Format:Inbunden
Språk:Engelska
Antal sidor:408
Förlag:John Wiley & Sons Inc
ISBN:9780471439608

Utforska kategorier

Systemvetenskap och AI inom Data och IT

Mer om författaren

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

Recensioner i media

"Its notional richness, while challenging, when combined with the instructional narrative is quite engaging-I found myself drawn into the text…" (IEEE Circuits & Devices, July/August 2004) "...uses a problem-solving approach that makes these computer languages concrete..." (SciTech Book News, Vol. 25, No. 4, December 2001)

Innehållsförteckning

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