Problem solving in automata, languages, and complexity /

A practical introduction to essential topics at the core of computer scienceAutomata, 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...

Full description

Bibliographic Details
Main Author: Du, Dingzhu
Other Authors: Ko, Ker-I
Format: eBook
Language:English
Language Notes:English.
Published: New York : Wiley, ©2001.
Subjects:
Online Access:Connect to the full text of this electronic book
Description
Summary:A practical introduction to essential topics at the core of computer scienceAutomata, 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-completenessFocused, practical, and versatile, Problem Solving in Automata, Languages, and Complexity gives students and engineers a solid grounding in essential areas in computer science.
Physical Description:1 online resource (viii, 396 pages) : illustrations
Bibliography:Includes bibliographical references (pages 387-388) and index.
ISBN:0471464082
9780471464082
0471439606
9780471439608
0471224642
9780471224648
1280264748
9781280264740
9786610264742
6610264740
0470321474
9780470321478