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.

Full Product Details

Author:   Ding-Zhu Du (University of Minnesota) ,  Ker-I Ko (State University of New York at Stony Brook) ,  Ker-i ko (University of Houston, USA)
Publisher:   John Wiley & Sons Inc
Imprint:   Wiley-Interscience
Dimensions:   Width: 16.20cm , Height: 2.40cm , Length: 24.00cm
Weight:   0.687kg
ISBN:  

9780471439608

ISBN 10:   0471439606
Pages:   408
Publication Date:   24 October 2001
Audience:   College/higher education ,  Professional and scholarly ,  Undergraduate ,  Postgraduate, Research & Scholarly
Format:   Hardback
Publisher's Status:   Active
Availability:   Out of stock  
The supplier is temporarily out of stock of this item. It will be ordered for you on backorder and shipped when it becomes available.

Table of Contents

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

Reviews

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)

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)

Author Information

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

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions