Concise Guide to Computation Theory - Hardcover

Críticas

From the reviews:

“This work could certainly serve as a text for an undergraduate computer science course, and it might also be considered for presenting these essential modern ideas to students in other majors. ... well-thought-out diagrams highlight important concepts and help elucidate proofs. An ideal text for a one-term course introducing computation theory to either majors or nonmajors; also appropriate for undergraduate self-study. Summing Up: Highly recommended. Upper-division undergraduates through professionals.”­­­ (P. Cull, Choice, Vol. 49 (3), November, 2011)

“The author walks a delicate path between presenting the breadth of topics and exploring all the depths of the theory, between writing a comprehensive (encyclopedic) textbook and providing a concise overview of the essential topics. ... a concise introduction to the theory of computation, concentrating on the fundamental results that have the greatest impact on the theory and its practical applications. ... very appropriate for graduate students in computer science or those academics who want a refresher course on the main results of the discipline.” (R. Goldberg, ACM Computing Reviews, March, 2012)

Reseña del editor

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.