Items related to Problem Solving in Automata, Languages, and Complexity

Problem Solving in Automata, Languages, and Complexity - Softcover

 
9780471224648: Problem Solving in Automata, Languages, and Complexity

This specific ISBN edition is currently not available.

Synopsis

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.

"synopsis" may belong to another edition of this title.

Review

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

From the Back 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.

"About this title" may belong to another edition of this title.

  • ISBN 10 0471224642
  • ISBN 13 9780471224648
  • BindingPaperback
  • LanguageEnglish

(No Available Copies)

Search Books:



Create a Want

Can't find the book you're looking for? We'll keep searching for you. If one of our booksellers adds it to AbeBooks, we'll let you know!

Create a Want

Other Popular Editions of the Same Title

9780471439608: Problem Solving in Automata, Languages, and Complexity

Featured Edition

ISBN 10:  0471439606 ISBN 13:  9780471439608
Publisher: Wiley-Interscience, 2001
Hardcover