|
![]() |
|||
|
||||
OverviewFull Product DetailsAuthor: Akira MaruokaPublisher: Springer London Ltd Imprint: Springer London Ltd Edition: 2011 ed. Dimensions: Width: 15.50cm , Height: 1.70cm , Length: 23.50cm Weight: 0.617kg ISBN: 9780857295347ISBN 10: 0857295349 Pages: 281 Publication Date: 06 May 2011 Audience: Professional and scholarly , Professional & Vocational Format: Hardback Publisher's Status: Active Availability: Awaiting stock ![]() The supplier is currently out of stock of this item. It will be ordered for you and placed on backorder. Once it does come back in stock, we will ship it out for you. Table of ContentsPart 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.ReviewsFrom 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) 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) Author InformationTab Content 6Author Website:Countries AvailableAll regions |