Computability, Complexity and Languages: Fundamentals of Theoretical Computer Science

Martin Davis , Elaine J. Weyuker , Ron Sigal

Covers the key areas of computer science, including recursive function theory, formal languages, and automata. This book is divided into five parts: Computability, Grammars and Automata, Logic, Complexity, and Unsolvability. It also covers in a variety of different arrangements automata theory, computational logic, and complexity theory.
  • Limba : Engleza
  • Cuprins : Preliminaries. Computability: Programs and Computable Functions. Primitive Recursive Functions. A Universal Program. Calculations on Strings. Turing Machines. Processes and Grammars. Classifying Unsolvable Problems. Grammars and Automata: Regular Languages. Context-Free Languages. Context-Sensitive Languages. Logic: Propositional Calculus. Quantification Theory. Complexity: Abstract Complexity. Polynomial Time Computability. Semantics: Approximation Orderings. Denotational Semantics of Recursion Equations. Operational Semantics of Recursion Equations. Suggestions for Further Reading. Subject Index.
  • Data Publicarii : 18 Mar 1994
  • Editie : 2 Rev ed
  • Format : Hardback
  • Numar pagini : 609
  • ISBN : 9780122063824
415.99 Lei
Disponibilitate : 2-4 saptamani

Acest titlu este disponibil in stocul furnizorilor si poate fi livrat in 2-4 saptamani.