{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":24,"n_cols":5,"rows_kept":24,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[2,4,2,5],[3,2,3,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[12,2,12,3],[13,2,13,3],[17,2,17,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910786636403321"]
[null,null,"Autore",null,"Davis Martin <1928-2023, >"]
[null,null,"Titolo",null,"Computability, complexity, and languages : fundamentals of theoretical computer science / / Martin D. Davis, Elaine J. Weyuker"]
[null,null,"Pubbl/distr/stampa",null,"New York, New York ; ; London, [England] : , : Academic Press, , 1983"]
[{"$nulls":4},"©1983"]
[null,null,"ISBN",null,"1-4832-6458-0"]
[null,null,"Descrizione fisica",null,"1 online resource (448 p.)"]
[null,null,"Collana",null,"Computer Science and Applied Mathematics"]
[null,null,"Disciplina",null,"511.3"]
[null,null,"Soggetti",null,"Machine theory"]
[{"$nulls":4},"Computational complexity"]
[{"$nulls":4},"Formal languages"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Description based upon print version of record."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"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"]
[{"$nulls":4},"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"]
[{"$nulls":4},"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-"]
[{"$nulls":4},"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"]
[{"$nulls":4},"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. Gödel's Incompleteness Theorem"]
[{"$nulls":4},"8. Unsolvability of the Satisfiability Problem in Predicate Logic"]
[null,null,null,"Sommario/riassunto","Computability, Complexity, and Languages"]