Problem solving in automata, languages, and complexity / / Ding-Zhu Du, Ker-I Ko

• Autore: Du Dingzhu
• Pubblicazione: New York, : Wiley, c2001
• Descrizione fisica: 1 online resource (405 p.)
• Disciplina: 511.3
• Soggetto topico: Machine theory; Formal languages; Computational complexity
• Altri autori: KoKer-I
• Note generali: "A Wiley-Interscience publication."
• Nota di bibliografia: Includes bibliographical references (p. 387-388) and index.
• Nota di contenuto: Contents; 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ödel 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
• Sommario/riassunto: 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.
• Titolo autorizzato: Problem solving in automata, languages, and complexity
• ISBN: 9786610264742; 9781280264740; 1280264748; 9780470321478; 0470321474; 9780471464082; 0471464082; 9780471224648; 0471224642
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Lingua di pubblicazione: Inglese
• Record Nr.: 9911018975403321
• Lo trovi qui: Univ. Federico II