LEADER 04265nam 2200625 450 001 9910828235103321 005 20230214003117.0 010 $a1-4832-6458-0 035 $a(CKB)3710000000200571 035 $a(EBL)1901552 035 $a(SSID)ssj0001266601 035 $a(PQKBManifestationID)12541682 035 $a(PQKBTitleCode)TC0001266601 035 $a(PQKBWorkID)11267926 035 $a(PQKB)11548653 035 $a(MiAaPQ)EBC1901552 035 $a(EXLCZ)993710000000200571 100 $a20150202h19831983 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aComputability, complexity, and languages $efundamentals of theoretical computer science /$fMartin D. Davis, Elaine J. Weyuker 210 1$aNew York, New York ;$aLondon, [England] :$cAcademic Press,$d1983. 210 4$dİ1983 215 $a1 online resource (448 p.) 225 1 $aComputer Science and Applied Mathematics 300 $aDescription based upon print version of record. 311 $a1-322-55867-1 311 $a0-12-206380-5 320 $aIncludes bibliographical references and index. 327 $aFront Cover; Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science; Copyright Page; Dedication; Table of Contents; Preface; Acknowledgments; Dependency Graph; CHAPTER 1. Preliminaries; 1. Sets and n-tuples; 2. Functions; 3. Alphabets and Strings; 4. Predicates; 5. Quantifiers; 6. Proof by Contradiction; 7. Mathematical Induction; PART 1: COMPUTABILITY; CHAPTER 2. Programs and Computable Functions; 1. A Programming Language; 2. Some Examples of Programs; 3. Syntax; 4. Computable Functions; 5. More about Macros; CHAPTER 3. Primitive Recursive Functions 327 $a4. Post-Turing ProgramsCHAPTER 6. Turing Machines; 1. Internal States; 2. A Universal Turing Machine; 3. The Languages Accepted by Turing Machines; 4. The Halting Problem for Turing Machines; 5. Nondeterministic Turing Machines; 6. Variations on the Turing Machine Theme; CHAPTER 7. Processes and Grammars; 1. Semi-Thue Processes; 2. Simulation of Nondeterministic Turing Machines by Semi-Thue Processes; 3. Unsolvable Word Problems; 4. Post's Correspondence Problem; 5. Grammars; 6. Some Unsolvable Problems Concerning Grammars; 7. Recursion and Minimalization; 8. Normal Processes 327 $a9. A Non-R.E. SetPART 2: GRAMMARS AND AUTOMATA; CHAPTER 8. Regular Languages; 1. Finite Automata; 2. Nondeterministic Finite Automata; 3. Additional Examples; 4. Closure Properties; 5. Kleene's Theorem; 6. The Pumping Lemma and Its Applications; 7. The Myhill-Nerode Theorem; CHAPTER 9. Context-Free Languages; 1. Context-Free Grammars and Their Derivation Trees; 2. Regular Grammars; 3. Chomsky Normal Form; 4. Bar-Hillel's Pumping Lemma; 5. Closure Properties; 6. Solvable and Unsolvable Problems; 7. Bracket Languages; 8. Pushdown Automata; 9. Compilers and Formal Languages 327 $aCHAPTER 10. Context-Sensitive Languages1. The Chomsky Hierarchy; 2. Linear Bounded Automata; 3. Closure Properties; PART 3: LOGIC; CHAPTER 11. Propositional Calculus; 1. Formulas and Assignments; 2. Tautological Inference; 3. Normal Forms; 4. The Davis-Putnam Rules; 5. Minimal Unsatisfiability and Subsumption; 6. Resolution; 7. The Compactness Theorem; CHAPTER 12. Quantification Theory; 1. The Language of Predicate Logic; 2. Semantics; 3. Logical Consequence; 4. Herbrand's Theorem; 5. Unification; 6. Compactness and Countability; 7. Go?del's Incompleteness Theorem 327 $a8. Unsolvability of the Satisfiability Problem in Predicate Logic 330 $aComputability, Complexity, and Languages 410 0$aComputer science and applied mathematics. 606 $aMachine theory 606 $aComputational complexity 606 $aFormal languages 615 0$aMachine theory. 615 0$aComputational complexity. 615 0$aFormal languages. 676 $a511.3 700 $aDavis$b Martin$f1928-2023,$01276157 702 $aWeyuker$b Elaine J. 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910828235103321 996 $aComputability, complexity, and languages$94115380 997 $aUNINA