Cargando…
Computability, complexity, and languages : fundamentals of theoretical computer science /
Computability, Complexity, and Languages.
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Otros Autores: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
New York :
Academic Press,
1983.
|
| Colección: | Computer science and applied mathematics.
|
| Temas: | |
| Acceso en línea: | Texto completo |
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | EBOOKCENTRAL_ocn644355044 | ||
| 003 | OCoLC | ||
| 005 | 20240329122006.0 | ||
| 006 | m o d | ||
| 007 | cr bn||||||abp | ||
| 007 | cr bn||||||ada | ||
| 008 | 100628s1983 nyua ob 001 0 eng d | ||
| 040 | |a OCLCE |b eng |e pn |c OCLCE |d OCLCQ |d OCLCO |d OCLCQ |d OCLCF |d OPELS |d EBLCP |d N$T |d E7B |d DEBSZ |d YDXCP |d OCLCQ |d MERUC |d INARC |d OCLCQ |d YDX |d UKAHL |d OCLCQ |d VLY |d LUN |d OCLCQ |d OCLCO |d S2H |d OCLCO |d COM |d OCLCO |d K6U |d OCLCQ |d OCLCA |d OCLCO |d OCLCL | ||
| 019 | |a 607745789 |a 898771974 |a 960895151 |a 1028563128 |a 1162219425 | ||
| 020 | |a 9780122063800 |q (electronic bk.) | ||
| 020 | |a 0122063805 |q (electronic bk.) | ||
| 020 | |a 9781483264585 | ||
| 020 | |a 1483264580 | ||
| 029 | 1 | |a AU@ |b 000055737912 | |
| 029 | 1 | |a DEBBG |b BV043616725 | |
| 029 | 1 | |a DEBSZ |b 431884374 | |
| 029 | 1 | |a NZ1 |b 15917011 | |
| 035 | |a (OCoLC)644355044 |z (OCoLC)607745789 |z (OCoLC)898771974 |z (OCoLC)960895151 |z (OCoLC)1028563128 |z (OCoLC)1162219425 | ||
| 042 | |a dlr | ||
| 050 | 4 | |a QA267 |b .D38 1983 | |
| 082 | 0 | 4 | |a 001.64/01 |2 19 |
| 084 | |a 54.10 |2 bcl | ||
| 049 | |a UAMI | ||
| 100 | 1 | |a Davis, Martin, |d 1928-2023. |1 https://id.oclc.org/worldcat/entity/E39PBJjCKmQPK7w8QbCKCDbjmd | |
| 245 | 1 | 0 | |a Computability, complexity, and languages : |b fundamentals of theoretical computer science / |c Martin D. Davis, Elaine J. Weyuker. |
| 260 | |a New York : |b Academic Press, |c 1983. | ||
| 300 | |a 1 online resource (xix, 425 pages) : |b illustrations | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 490 | 1 | |a Computer science and applied mathematics | |
| 504 | |a Includes bibliographical references (pages 417-418) and index. | ||
| 506 | |3 Use copy |f Restrictions unspecified |2 star |5 MiAaHDL | ||
| 533 | |a Electronic reproduction. |b [Place of publication not identified] : |c HathiTrust Digital Library, |d 2010. |5 MiAaHDL | ||
| 538 | |a Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002. |u http://purl.oclc.org/DLF/benchrepro0212 |5 MiAaHDL | ||
| 583 | 1 | |a digitized |c 2010 |h HathiTrust Digital Library |l committed to preserve |2 pda |5 MiAaHDL | |
| 588 | 0 | |a Print version record. | |
| 505 | 0 | |a Front 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 | |
| 505 | 8 | |a 4. 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 | |
| 505 | 8 | |a 9. 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 | |
| 505 | 8 | |a CHAPTER 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. Gödel's Incompleteness Theorem | |
| 520 | |a Computability, Complexity, and Languages. | ||
| 546 | |a English. | ||
| 590 | |a ProQuest Ebook Central |b Ebook Central Academic Complete | ||
| 650 | 0 | |a Machine theory. | |
| 650 | 0 | |a Computational complexity. | |
| 650 | 0 | |a Formal languages. | |
| 650 | 6 | |a Théorie des automates. | |
| 650 | 6 | |a Complexité de calcul (Informatique) | |
| 650 | 6 | |a Langages formels. | |
| 650 | 7 | |a Computational complexity |2 fast | |
| 650 | 7 | |a Formal languages |2 fast | |
| 650 | 7 | |a Machine theory |2 fast | |
| 650 | 7 | |a Berechenbarkeit |2 gnd | |
| 650 | 7 | |a Formale Sprache |2 gnd | |
| 650 | 7 | |a Komplexität |2 gnd | |
| 650 | 1 | 7 | |a Informatica. |2 gtt |
| 650 | 1 | 7 | |a Fundamentele informatica. |2 gtt |
| 700 | 1 | |a Weyuker, Elaine J. | |
| 758 | |i has work: |a Computability, complexity, and languages (Text) |1 https://id.oclc.org/worldcat/entity/E39PCFCkfJTWcqrBVhdchvmYbm |4 https://id.oclc.org/worldcat/ontology/hasWork | ||
| 776 | 0 | 8 | |i Print version: |a Davis, Martin, 1928- |t Computability, complexity, and languages. |d New York : Academic Press, 1983 |w (DLC) 83002727 |w (OCoLC)9282499 |
| 830 | 0 | |a Computer science and applied mathematics. | |
| 856 | 4 | 0 | |u https://ebookcentral.uam.elogim.com/lib/uam-ebooks/detail.action?docID=1901552 |z Texto completo |
| 938 | |a Askews and Holts Library Services |b ASKH |n AH25551562 | ||
| 938 | |a ProQuest Ebook Central |b EBLB |n EBL1901552 | ||
| 938 | |a ebrary |b EBRY |n ebr11008623 | ||
| 938 | |a EBSCOhost |b EBSC |n 931791 | ||
| 938 | |a Internet Archive |b INAR |n computabilitycom00dav_ja7 | ||
| 938 | |a YBP Library Services |b YANK |n 12220821 | ||
| 994 | |a 92 |b IZTAP | ||