Concise guide to computation theory / Akira Maruoka

By:

Maruoka, Akira [author]

Material type: Text

TextPublication details: London, United Kingdom : Springer-Verlag, c2011Description: xvii, 281 pages : illustrations ; 25 cm.USDISBN:

9780857295347

Subject(s):

COMPUTER SCIENCE

LOC classification:

QA 267.7 .M37 2011

Contents:

pt. 1. The theory of computation -- pt. 2. Automata and languages -- pt. 3. Computability -- pt. 4. Complexity of computation -- pt. 5. Conclusions and exercise solutions.

Summary: 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.

Item type:

Books

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Home library	Collection	Call number	Copy number	Status	Date due	Barcode
Books	National University - Manila	LRC - Main General Circulation	Multimedia Arts and Animation	GC QA 267.7 .M37 2011 (Browse shelf(Opens below))	c.1	Available		NULIB000010720

Browsing LRC - Main shelves, Shelving location: General Circulation, Collection: Multimedia Arts and Animation Close shelf browser (Hides shelf browser)

Previous					No cover image available			Next
Previous	GC QA 76.758 .L68 2021 c.2 Software engineering for absolute beginners : your guide to creating software products /	GC QA 76.774 .D45 2016 Sam's Teach Yourself Android application development in 24 hours /	GC QA 76.774.I67 .N37 2013 iOS 6 programming : pushing the limits advanced application development for Apple IPhone, IPad, and IPod Touch /	GC QA 267.7 .M37 2011 Concise guide to computation theory /	GC QA 76 .B74 [2022] c.2 An Introduction to computer science for young people /	GC QA 76 .C66 2021 c.2 Computing fundamentals : study guide.	GC TA 1540 .P45 2017 Envisioning holograms : design breakthrough experiences for mixed reality /	Next

Includes bibliographical references and index.

pt. 1. The theory of computation -- pt. 2. Automata and languages -- pt. 3. Computability -- pt. 4. Complexity of computation -- pt. 5. Conclusions and exercise solutions.

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.

There are no comments on this title.

to post a comment.