Includes bibliographical references (pages 387-388) and index.

Print version record.

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.

Preface; 1 Regular Languages; 1.1 Strings and Languages; 1.2 Regular Languages and Regular Expressions; 1.3 Graph Representations for Regular Expressions; 2 Finite Automata; 2.1 Deterministic Finite Automata; 2.2 Examples of Deterministic Finite Automata; 2.3 Nondeterministic Finite Automata; 2.4 Converting an NFA to a DFA; 2.5 Finite Automata and Regular Expressions; 2.6 Closure Properties of Regular Languages; 2.7 Minimum Deterministic Finite Automata; 2.8 Pumping Lemmas; 3 Context-Free Languages; 3.1 Context-Free Grammars; 3.2 More Examples of Context-Free Grammars

3.3 Parsing and Ambiguity3.4 Pushdown Automata; 3.5 Pushdown Automata and Context-Free Grammars; 3.6 Pumping Lemmas for Context-Free Languages; 4 Turing Machines; 4.1 One-Tape Turing Machines; 4.2 Examples of Turing Machines; 4.3 Multi-Tape Turing Machines; 4.4 Church-Turing Thesis; 4.5 Unrestricted Grammars; 4.6 Primitive Recursive Functions; 4.7 Pairing Functions and G�odel Numberings; 4.8 Partial Recursive Functions; 5 Computability Theory; 5.1 Universal Turing Machines; 5.2 R. E. Sets and Recursive Sets; 5.3 Diagonalization; 5.4 Reducibility; 5.5 Recursion Theorem; 5.6 Undecidable Problems

6 Computational Complexity6.1 Asymptotic Growth Rate; 6.2 Time and Space Complexity; 6.3 Hierarchy Theorems; 6.4 Nondeterministic Turing Machines; 6.5 Context-Sensitive Languages; 7 NP-Completeness; 7.1 NP; 7.2 Polynomial-Time Reducibility; 7.3 Cook's Theorem; 7.4 More NP-Complete Problems; 7.5 NP-Complete Optimization Problems; References; Index; A; B; C; D; E; F; G; H; I; K; L; M; N; O; P; Q; R; S; T; U; V; W; X; Z

English.

John Wiley and Sons Wiley Online Library: Complete oBooks