Stock photo: cover may vary
Problem Solving In Automata, Languages, and Complexity Hardback - 2001
by Ding-Zhu Du, Ker-I Ko,
- Used
A$246.08
A$5.77
Delivery within USA
Standard delivery: 2 to 14 days
More delivery options
Standard delivery: 2 to 14 days
Ships from GreatBookPrices (Maryland, United States)
Details
- Title Problem Solving In Automata, Languages, and Complexity
- Author Ding-Zhu Du, Ker-I Ko,
- Binding Hardback
- Edition First Printing
- Condition New
- Pages 408
- Volumes 1
- Language ENG
- Publisher Wiley-Interscience, New York, New York, U.S.A.
- Publication date 2001-10-03
- Illustrated Yes
- Features Illustrated, Index, Table of Contents
- Bookseller's Inventory # 32997
- ISBN 9780471439608 / 0471439606
- Weight 1.64 lbs (0.74 kg)
- Dimensions 9.21 x 6.14 x 0.94 in (23.39 x 15.60 x 2.39 cm)
- Category Computers - General Information
- Library of Congress subjects Computational complexity, Machine theory
- Library of Congress Catalogue Number 2001275892
- Dewey Decimal Code 511.3
- Quantity available 5
About GreatBookPrices Maryland, United States
Biblio member since 2024
Since 1991, we have worked every day to serve our customers with state-of-the-art technology and world class service. We are dedicated to providing customers around the world with the widest selection of books, DVDs, and CDs at the absolute lowest price.
Reader reviews for Problem Solving In Automata, Languages, and Complexity
Write a review for this book
Important Terms and Guidelines
- Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
- Reviews must be at least 140 characters in length.
- Please do not reveal critical plot elements.
- This is not a help line. Contact customer support if you need help.
Your review must not include:
- Obscenities, discriminatory language, or other insulting language not suitable for public domain
- Advertisements, “spam” content, or references to other products, offers or websites.
- Email addresses, URLs, phone numbers, physical addresses or other contact information.
- Overly critical comments about other reviews or reviewers
- Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
- Availability, price, or alternative ordering/shipping information
From the publisher
From the rear cover
A practical introduction to essential topics at the core of computer science
Automata, formal language, and complexity theory are central to the understanding of computer science. This book provides, in an accessible, practically oriented style, a thorough grounding in these topics for practitioners and students on all levels.
Based on the authors' belief that the problem-solving approach is the most effective, Problem Solving in Automata, Languages, and Complexity collects a rich variety of worked examples, questions, and exercises designed to ensure understanding and mastery of the subject matter. Building from the fundamentals for beginning engineers to more advanced concepts, the book examines the most common topics in the field, including:
- Finite-state automata
- Context-free grammars
- Turing machines
- Recursive and recursively enumerable languages
- Computability theory
- Complexity classes
- NP-completeness
Focused, practical, and versatile, Problem Solving in Automata, Languages, and Complexity gives students and engineers a solid grounding in essential areas in computer science.
Media reviews
Citations
- Scitech Book News, 12/01/2001, Page 40
