Dekorationsartikel gehören nicht zum Leistungsumfang.
Computability, Complexity, and Languages
Fundamentals of Theoretical Computer Science
Buch von Martin Davis (u. a.)
Sprache: Englisch

53,30 €*

inkl. MwSt.

Versandkostenfrei per Post / DHL

Lieferzeit 4-7 Werktage

Kategorien:
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
Genre: Informatik
Rubrik: Naturwissenschaften & Technik
Medium: Buch
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
Maße: 228 x 152 x 234 mm
Von/Mit: Martin Davis (u. a.)
Gewicht: 0,97 kg
preigu-id: 126704057
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
Genre: Informatik
Rubrik: Naturwissenschaften & Technik
Medium: Buch
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
Maße: 228 x 152 x 234 mm
Von/Mit: Martin Davis (u. a.)
Gewicht: 0,97 kg
preigu-id: 126704057
Warnhinweis

Ähnliche Produkte

Ähnliche Produkte