Concise Guide to Computation Theory (Paperback, 2011 ed.)

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.

General

Imprint:	Springer London
Country of origin:	United Kingdom
Release date:	August 2014
First published:	2011
Authors:	Akira Maruoka
Dimensions:	235 x 155 x 16mm (L x W x T)
Format:	Paperback
Pages:	281
Edition:	2011 ed.
ISBN-13:	978-1-4471-5816-5
Categories:	Books > Computing & IT > General theory of computing > General Books > Computing & IT > Applications of computing > General Books > Science & Mathematics > Mathematics > Applied mathematics > Mathematics for scientists & engineers
LSN:	1-4471-5816-4
Barcode:	9781447158165

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!