UID:
edocfu_9959327337602883
Format:
1 online resource (viii, 396 pages) :
,
illustrations
ISBN:
0471464082
,
9780471464082
,
0471439606
,
9780471439608
,
0471224642
,
9780471224648
Content:
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.
Additional Edition:
Print version: Du, Dingzhu. Problem solving in automata, languages, and complexity. New York : Wiley, ©2001 ISBN 0471439606
Language:
English
Keywords:
Electronic books.
URL:
https://onlinelibrary.wiley.com/doi/book/10.1002/0471224642
Bookmarklink