Martin Davis,
Martin (Courant Institute of Mathematical Sciences of New York University, New York, U.S.A.) Davis,
Ron Sigal,
Ron (Consultant, New Haven, Connecticut, U.S.A.) Sigal,
Elaine J. Weyuker,
Elaine J. (AT&T Labs Research, Florham Park, New Jersey, U.S.A.) Weyuker
e.a.
Elsevier Science
e druk, 1994
9780122063824
Computability, Complexity, and Languages
Fundamentals of Theoretical Computer Science
Specificaties
Paperback, blz.
|
Engels
Elsevier Science |
e druk, 1994
ISBN13: 9780122063824
Rubricering
Onderdeel van serie
Computer Science and Scientific Computing
Levertijd ongeveer 8 werkdagen
Samenvatting
Computability, Complexity, and Languages is an introductory text that 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.
Specificaties
Inhoudsopgave
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. PolynomialTime Computability. Semantics: Approximation Orderings. Denotational Semantics of Recursion Equations. Operational Semantics of Recursion Equations. Suggestions for Further Reading. Subject Index.