| 000 | 06922cam a2201033 a 4500 | ||
|---|---|---|---|
| 001 | ocm53229117 | ||
| 003 | OCoLC | ||
| 005 | 20240523125528.0 | ||
| 006 | m o d | ||
| 007 | cr cnu---unuuu | ||
| 008 | 031017s2001 nyua ob 001 0 eng d | ||
| 010 | _z 2001275892 | ||
| 040 |
_aN$T _beng _epn _cN$T _dYDXCP _dOCLCQ _dZMC _dOCLCQ _dN$T _dOCLCF _dDG1 _dBTCTA _dOCLCO _dEBLCP _dTEFOD _dIDEBK _dE7B _dNLGGC _dOCLCQ _dSLY _dOCLCQ _dTEFOD _dCOO _dOCLCQ _dDG1 _dSUR _dLIP _dOCLCQ _dDEBSZ _dOCLCQ _dINT _dOCLCQ _dU3W _dOCLCQ _dSFB _dVLY _dUKEHC _dOCLCO _dINARC _dOCLCQ _dOCLCO _dOCLCL _dOCLCQ |
||
| 015 | _aGBA1-V2365 | ||
| 019 |
_a77492153 _a85820085 _a122260749 _a646791255 _a839294785 _a880335222 _a961612389 _a962704509 _a984876511 _a1053055867 _a1162377342 _a1200073495 _a1285749747 |
||
| 020 |
_a0471464082 _q(electronic bk.) |
||
| 020 |
_a9780471464082 _q(electronic bk.) |
||
| 020 |
_a0471439606 _q(acid-free paper) |
||
| 020 |
_a9780471439608 _q(acid-free paper) |
||
| 020 |
_a0471224642 _q(electronic bk.) |
||
| 020 |
_a9780471224648 _q(electronic bk.) |
||
| 020 | _a1280264748 | ||
| 020 | _a9781280264740 | ||
| 020 | _a9786610264742 | ||
| 020 | _a6610264740 | ||
| 020 | _a0470321474 | ||
| 020 | _a9780470321478 | ||
| 024 | 7 |
_a10.1002/0471224642 _2doi |
|
| 029 | 1 |
_aAU@ _b000024297773 |
|
| 029 | 1 |
_aAU@ _b000056129971 |
|
| 029 | 1 |
_aCHNEW _b000927630 |
|
| 029 | 1 |
_aCHVBK _b480078742 |
|
| 029 | 1 |
_aDEBSZ _b400438747 |
|
| 029 | 1 |
_aNZ1 _b14136055 |
|
| 029 | 1 |
_aAU@ _b000075628589 |
|
| 035 |
_a(OCoLC)53229117 _z(OCoLC)77492153 _z(OCoLC)85820085 _z(OCoLC)122260749 _z(OCoLC)646791255 _z(OCoLC)839294785 _z(OCoLC)880335222 _z(OCoLC)961612389 _z(OCoLC)962704509 _z(OCoLC)984876511 _z(OCoLC)1053055867 _z(OCoLC)1162377342 _z(OCoLC)1200073495 _z(OCoLC)1285749747 |
||
| 037 |
_aEBL215154 _beBook Library _nhttp://www.eblib.com |
||
| 037 |
_a8531CC0C-7884-423B-B1C3-3C4EDFF582EE _bOverDrive, Inc. _nhttp://www.overdrive.com |
||
| 050 | 4 |
_aQA267 _b.D8 2001eb |
|
| 072 | 7 |
_aMAT _x016000 _2bisacsh |
|
| 072 | 7 |
_aMAT _x018000 _2bisacsh |
|
| 082 | 0 | 4 |
_a511.3 _222 |
| 084 |
_aO141 _2clc |
||
| 084 |
_aTP23 _2clc |
||
| 084 |
_aTP311. 11 _2clc |
||
| 084 |
_aTP301 _2clc |
||
| 049 | _aMAIN | ||
| 100 | 1 | _aDu, Dingzhu. | |
| 245 | 1 | 0 |
_aProblem solving in automata, languages, and complexity / _cDing-Zhu Du, Ker-I Ko. |
| 260 |
_aNew York : _bWiley, _c�2001. |
||
| 300 |
_a1 online resource (viii, 396 pages) : _billustrations |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 504 | _aIncludes bibliographical references (pages 387-388) and index. | ||
| 588 | 0 | _aPrint version record. | |
| 520 | _aA 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. | ||
| 505 | 0 | _aPreface; 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 | |
| 505 | 8 | _a3.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 | |
| 505 | 8 | _a6 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 | |
| 546 | _aEnglish. | ||
| 590 |
_aJohn Wiley and Sons _bWiley Online Library: Complete oBooks |
||
| 650 | 0 | _aMachine theory. | |
| 650 | 0 | _aFormal languages. | |
| 650 | 0 | _aComputational complexity. | |
| 650 | 6 | _aTh�eorie des automates. | |
| 650 | 6 | _aLangages formels. | |
| 650 | 6 | _aComplexit�e de calcul (Informatique) | |
| 650 | 7 |
_aMATHEMATICS _xInfinity. _2bisacsh |
|
| 650 | 7 |
_aMATHEMATICS _xLogic. _2bisacsh |
|
| 650 | 0 | 7 |
_aFormal languages. _2cct |
| 650 | 0 | 7 |
_aComputational complexity. _2cct |
| 650 | 0 | 7 |
_aMachine theory. _2cct |
| 650 | 7 |
_aComputational complexity _2fast |
|
| 650 | 7 |
_aFormal languages _2fast |
|
| 650 | 7 |
_aMachine theory _2fast |
|
| 653 | _aComputer science special topics. | ||
| 700 | 1 | _aKo, Ker-I. | |
| 758 |
_ihas work: _aProblem solving in automata, languages, and complexity (Text) _1https://id.oclc.org/worldcat/entity/E39PCGGqKRFMxMQYpGh3jMbMHd _4https://id.oclc.org/worldcat/ontology/hasWork |
||
| 776 | 0 | 8 |
_iPrint version: _aDu, Dingzhu. _tProblem solving in automata, languages, and complexity. _dNew York : Wiley, �2001 _z0471439606 _w(DLC) 2001275892 _w(OCoLC)48222937 |
| 856 | 4 | 0 | _uhttps://onlinelibrary.wiley.com/doi/book/10.1002/0471224642 |
| 938 |
_aBaker and Taylor _bBTCP _nBK0007317567 |
||
| 938 |
_aebrary _bEBRY _nebr10272349 |
||
| 938 |
_aEBSCOhost _bEBSC _n98968 |
||
| 938 |
_aYBP Library Services _bYANK _n2298332 |
||
| 938 |
_aYBP Library Services _bYANK _n2942871 |
||
| 938 |
_aInternet Archive _bINAR _nproblemsolvingin0000dudi |
||
| 994 |
_a92 _bINLUM |
||
| 999 |
_c11083 _d11083 |
||