Concise Guide to Computation Theory

Nonfiction, Computers, Advanced Computing, Computer Science, General Computing, Science & Nature, Science
Cover of the book Concise Guide to Computation Theory by Akira Maruoka, Springer London
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: Akira Maruoka ISBN: 9780857295354
Publisher: Springer London Publication: April 29, 2011
Imprint: Springer Language: English
Author: Akira Maruoka
ISBN: 9780857295354
Publisher: Springer London
Publication: April 29, 2011
Imprint: Springer
Language: English

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.

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

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.

More books from Springer London

Cover of the book Anticancer Genes by Akira Maruoka
Cover of the book PEM Fuel Cells with Bio-Ethanol Processor Systems by Akira Maruoka
Cover of the book Dependability of Networked Computer-based Systems by Akira Maruoka
Cover of the book Telenursing by Akira Maruoka
Cover of the book Computational Social Networks by Akira Maruoka
Cover of the book Pediatric Thoracic Surgery by Akira Maruoka
Cover of the book Understanding Learning in Virtual Worlds by Akira Maruoka
Cover of the book Molecular Biology of Valvular Heart Disease by Akira Maruoka
Cover of the book Sir Thomas Lewis by Akira Maruoka
Cover of the book Cellular and Molecular Biology of Atherosclerosis by Akira Maruoka
Cover of the book Network Geeks by Akira Maruoka
Cover of the book Fundamentals of Neuromechanics by Akira Maruoka
Cover of the book Fundamental Anatomy for Operative General Surgery by Akira Maruoka
Cover of the book Multimodality Imaging for Transcatheter Aortic Valve Replacement by Akira Maruoka
Cover of the book Vertigo and Dizziness by Akira Maruoka
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy