Zum Hauptinhalt springen Zur Suche springen Zur Hauptnavigation springen
Beschreibung
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.
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.
Inhaltsverzeichnis
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.
Details
Erscheinungsjahr: 1994
Genre: Informatik
Rubrik: Naturwissenschaften & Technik
Medium: Taschenbuch
Inhalt: Gebunden
ISBN-13: 9780122063824
ISBN-10: 0122063821
Sprache: Englisch
Herstellernummer: C2009-0-21176-7
Autor: Davis, Martin
Sigal, Ron
Weyuker, Elaine J.
Auflage: 2. Aufl.
Hersteller: Morgan Kaufmann
Elsevier Science & Technology
Verantwortliche Person für die EU: Zeitfracht Medien GmbH, Ferdinand-Jühlke-Str. 7, D-99095 Erfurt, produktsicherheit@zeitfracht.de
Maße: 29 x 156 x 234 mm
Von/Mit: Martin Davis (u. a.)
Erscheinungsdatum: 18.03.1994
Gewicht: 0,97 kg
Artikel-ID: 126704057

Ähnliche Produkte