Cargando…
Computability, complexity, and languages : fundamentals of theoretical computer science /
This introductory text covers the key areas of computer science, including recursive function theory, formal languages, and automata. It assumes a minimal background in formal mathematics. The book is divided into five parts: Computability, Grammars and Automata, Logic, Complexity, and Unsolvability...
| Clasificación: | Libro Electrónico |
|---|---|
| Autores principales: | , , |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Boston :
Academic Press, Harcourt, Brace,
1994.
|
| Edición: | 2nd ed. |
| Colección: | Computer science and scientific computing.
|
| Temas: | |
| Acceso en línea: | Texto completo |
MARC
| LEADER | 00000cam a2200000Ma 4500 | ||
|---|---|---|---|
| 001 | SCIDIR_ocn815471193 | ||
| 003 | OCoLC | ||
| 005 | 20231117044749.0 | ||
| 006 | m o d | ||
| 007 | cr cn||||||||| | ||
| 008 | 930630s1994 mauad ob 001 0 eng d | ||
| 040 | |a E7B |b eng |e pn |c E7B |d OCLCO |d OCLCQ |d N$T |d UIU |d OPELS |d OCLCQ |d TEFOD |d OCLCF |d UIU |d YDXCP |d EBLCP |d TEFOD |d OCLCQ |d NLE |d OCLCQ |d UKMGB |d YDX |d OL$ |d OCLCQ |d CUS |d OCLCQ |d LEAUB |d HS0 |d OCLCO |d OCLCQ |d OCLCA |d OCLCO | ||
| 015 | |a GBB6H3834 |2 bnb | ||
| 016 | 7 | |a 017581904 |2 Uk | |
| 019 | |a 818819888 |a 932055041 |a 1086490049 |a 1266312552 | ||
| 020 | |a 9780080502465 |q (electronic bk.) | ||
| 020 | |a 0080502466 |q (electronic bk.) | ||
| 020 | |z 0122063821 | ||
| 020 | |z 9780122063824 | ||
| 035 | |a (OCoLC)815471193 |z (OCoLC)818819888 |z (OCoLC)932055041 |z (OCoLC)1086490049 |z (OCoLC)1266312552 | ||
| 050 | 4 | |a QA267 |b .D38 1994eb | |
| 072 | 7 | |a MAT |x 016000 |2 bisacsh | |
| 072 | 7 | |a MAT |x 018000 |2 bisacsh | |
| 082 | 0 | 4 | |a 511.3 |2 20 |
| 084 | |a 54.10 |2 bcl | ||
| 100 | 1 | |a Davis, Martin, |d 1928-2023, |e author. | |
| 245 | 1 | 0 | |a Computability, complexity, and languages : |b fundamentals of theoretical computer science / |c Martin D. Davis, Ron Sigal, Elaine J. Weyuker. |
| 250 | |a 2nd ed. | ||
| 260 | |a Boston : |b Academic Press, Harcourt, Brace, |c 1994. | ||
| 300 | |a 1 online resource (xix, 609 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 scientific computing | |
| 504 | |a Includes bibliographical references (pages 593-594)-and indexes. | ||
| 520 | |a This introductory text covers the key areas of computer science, including recursive function theory, formal languages, and automata. It assumes a minimal background in formal mathematics. The book is divided into five parts: Computability, Grammars and Automata, Logic, Complexity, and Unsolvability. * Computability theory is introduced in a manner that makes maximum use of previous programming experience, including a "universal" program that takes up less than a page. * The number of exercises included has more than tripled. * Automata theory, computational logic, and complexity theory are presented in a flexible manner, and can be covered in a variety of different arrangements. | ||
| 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 1. Composition2. Recursion; 3. PRC Classes; 4. Some Primitive Recursive Functions; 5. Primitive Recursive Predicates; 6. Iterated Operations and Bounded Quantifiers; 7. Minimalization; 8. Pairing Functions and G�odel Numbers; Chapter 4. A Universal Program; 1. Coding Programs by Numbers; 2. The Halting Problem; 3. Universality; 4. Recursively Enumerable Sets; 5. The Parameter Theorem; 6. Diagonalization and Reducibility; 7. Rice's Theorem; *8. The Recursion Theorem; *9. A Computable Function That Is Not Primitive Recursive; Chapter 5. Calculations on Strings. | |
| 505 | 8 | |a 1. Numerical Representation of Strings2. A Programming Language for String Computations; 3. The Languages L and Ln; 4. Post-Turing Programs; 5. Simulation of Ln in F; 6. Simulation of F in L; Chapter 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. | |
| 505 | 8 | |a 3. Unsolvable Word Problems4. Post's Correspondence Problem; 5. Grammars; 6. Some Unsolvable Problems Concerning Grammars; *7. Normal Processes; Chapter 8. Classifying Unsolvable Problems; 1. Using Oracles; 2. Relativization of Universality; 3. Reducibility; 4. Sets r.e. Relative to an Oracle; 5. The Arithmetic Hierarchy; 6. Post's Theorem; 7. Classifying Some Unsolvable Problems; 8. Rice's Theorem Revisited; 9. Recursive Permutations; Part 2: Grammars and Automata; Chapter 9. Regular Languages; 1. Finite Automata; 2. Nondeterministic Finite Automata; 3. Additional Examples. | |
| 505 | 8 | |a 4. Closure Properties5. Kleene's Theorem; 6. The Pumping Lemma and Its Applications; 7. The Myhill-Nerode Theorem; Chapter 10. 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; Chapter 11. Context-Sensitive Languages; 1. The Chomsky Hierarchy; 2. Linear Bounded Automata; 3. Closure Properties; Part 3: Logic; Chapter 12. Propositional Calculus. | |
| 650 | 0 | |a Machine theory. | |
| 650 | 0 | |a Computational complexity. | |
| 650 | 0 | |a Formal languages. | |
| 650 | 6 | |a Th�eorie des automates. |0 (CaQQLa)201-0002733 | |
| 650 | 6 | |a Complexit�e de calcul (Informatique) |0 (CaQQLa)201-0068287 | |
| 650 | 6 | |a Langages formels. |0 (CaQQLa)201-0025413 | |
| 650 | 7 | |a MATHEMATICS |x Infinity. |2 bisacsh | |
| 650 | 7 | |a MATHEMATICS |x Logic. |2 bisacsh | |
| 650 | 7 | |a Computational complexity |2 fast |0 (OCoLC)fst00871991 | |
| 650 | 7 | |a Formal languages |2 fast |0 (OCoLC)fst00932922 | |
| 650 | 7 | |a Machine theory |2 fast |0 (OCoLC)fst01004846 | |
| 650 | 1 | 7 | |a Informatica. |2 gtt |
| 650 | 1 | 7 | |a Fundamentele informatica. |2 gtt |
| 650 | 7 | |a Mathematics. |2 hilcc | |
| 650 | 7 | |a Physical Sciences & Mathematics. |2 hilcc | |
| 650 | 7 | |a Algebra. |2 hilcc | |
| 650 | 7 | |a Linguagens formais e automatos. |2 larpcal | |
| 650 | 7 | |a Computabilidade e modelos de computacao. |2 larpcal | |
| 650 | 7 | |a Langages formels. |2 ram | |
| 650 | 7 | |a Complexit�e de calcul (informatique) |2 ram | |
| 650 | 7 | |a Automates math�ematiques, Th�eorie des. |2 ram | |
| 650 | 7 | |a Fonctions calculables. |2 ram | |
| 700 | 1 | |a Sigal, Ron, |e author. | |
| 700 | 1 | |a Weyuker, Elaine J., |e author. | |
| 776 | 0 | 8 | |i Print version: |a Davis, Martin. |t Computability, Complexity, and Languages : Fundamentals of Theoretical Computer Science. |d Burlington : Elsevier Science, �1994 |z 9780122063824 |
| 830 | 0 | |a Computer science and scientific computing. | |
| 856 | 4 | 0 | |u https://sciencedirect.uam.elogim.com/science/book/9780122063824 |z Texto completo |