Concise Guide to Computation Theory

Dekorationsartikel gehören nicht zum Leistungsumfang.

Sprache: Englisch

46,95 €*

-12 % UVP 53,49 €

inkl. MwSt.

Versandkostenfrei per Post / DHL

Lieferzeit 2-4 Werktage

Kategorien:

Der Artikel ist nicht in deutscher Sprache verfasst.
Die Sprache der Produktbeschreibung und Details kann in Englisch angegeben sein. Sollten Sie Verständnisprobleme haben, wenden Sie sich gerne an uns.

Beschreibung

This textbook presents a thorough foundation to the theory of computation. Combining intuitive descriptions and illustrations with rigorous arguments and detailed proofs for key topics, the logically structured discussion guides the reader through the core concepts of automata and languages, computability, and complexity of computation. Topics and features: presents a detailed introduction to the theory of computation, complete with concise explanations of the mathematical prerequisites; provides end-of-chapter problems with solutions, in addition to chapter-opening summaries and numerous examples and definitions throughout the text; draws upon the author¿s extensive teaching experience and broad research interests; discusses finite automata, context-free languages, and pushdown automata; examines the concept, universality and limitations of the Turing machine; investigates computational complexity based on Turing machines and Boolean circuits, as well as the notion of NP-completeness.

Zusammenfassung

Presents a detailed introduction to the theory of computation, complete with concise explanations of the mathematical prerequisites

Provides end-of-chapter problems with solutions, in addition to chapter-opening summaries and numerous examples and definitions throughout the text

Draws upon the author's extensive teaching experience and broad research interests

Includes supplementary material: [...]

Inhaltsverzeichnis

Part I: The Theory of Computation.-Everything Begins With Computation.- Preliminaries to the Theory of Computation.- Part II: Automata and Languages.-Finite Automata.- Context-Free Languages.- Pushdown Automaton.- Part III: Computability.-Turing Machine.- Universality of Turing Machine and its Limitation.- Part IV: Complexity of Computation.-Computational Complexity Based on Turing Machines.- Computational Complexity Based on Boolean Circuits.- NP-Completeness.- Solutions.- Concluding Remarks.

Details

Erscheinungsjahr:	2014
Genre:	Importe , Informatik
Rubrik:	Naturwissenschaften & Technik
Medium:	Taschenbuch
Inhalt:	xvii 281 S.
ISBN-13:	9781447158165
ISBN-10:	1447158164
Sprache:	Englisch
Einband:	Kartoniert / Broschiert
Autor:	Maruoka, Akira
Hersteller:	Springer London
Verantwortliche Person für die EU:	Springer Verlag GmbH, Tiergartenstr. 17, D-69121 Heidelberg, juergen.hartmann@springer.com
Maße:	235 x 155 x 17 mm
Von/Mit:	Akira Maruoka
Erscheinungsdatum:	29.08.2014
Gewicht:	0,458 kg

Artikel-ID: 105125327