Concise Guide to Computation Theory
Autor Akira Maruokaen Limba Engleză Paperback – 29 aug 2014
| Toate formatele și edițiile | Preț | Express |
|---|---|---|
| Paperback (1) | 325.88 lei 43-57 zile | |
| SPRINGER LONDON – 29 aug 2014 | 325.88 lei 43-57 zile | |
| Hardback (1) | 330.23 lei 43-57 zile | |
| SPRINGER LONDON – 6 mai 2011 | 330.23 lei 43-57 zile |
Preț: 325.88 lei
Preț vechi: 407.35 lei
-20% Nou
Puncte Express: 489
Preț estimativ în valută:
62.37€ • 64.78$ • 51.80£
62.37€ • 64.78$ • 51.80£
Carte tipărită la comandă
Livrare economică 03-17 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9781447158165
ISBN-10: 1447158164
Pagini: 300
Ilustrații: XVII, 281 p.
Dimensiuni: 155 x 235 x 16 mm
Greutate: 0.42 kg
Ediția:2011
Editura: SPRINGER LONDON
Colecția Springer
Locul publicării:London, United Kingdom
ISBN-10: 1447158164
Pagini: 300
Ilustrații: XVII, 281 p.
Dimensiuni: 155 x 235 x 16 mm
Greutate: 0.42 kg
Ediția:2011
Editura: SPRINGER LONDON
Colecția Springer
Locul publicării:London, United Kingdom
V-ar putea interesa
-
Preț: 62.92 lei -
Methods in Theoretical Quantum OpticsStephen M. Barnett-22%Preț: 429.44 lei552.39 lei -
Planets: A Very Short IntroductionDavid A. Rothery-17%Preț: 46.57 lei56.39 lei -
-9%Preț: 1477.41 lei1623.53 lei -
We Need to Talk About KelvinMarcus ChownPreț: 69.78 lei -
Practical Computing for BiologistsSteven H. D. Haddock-21%Preț: 697.13 lei884.47 lei -
Crossing the Threshold: Advancing Into Space to Benefit the EarthPaul O. Wieland PePreț: 102.01 lei -
-15%Preț: 589.75 lei693.83 lei -
Essential Maths Skills for AS/A Level BiologyDan Foulder-12%Preț: 91.42 lei103.41 lei -
Essential Maths Skills for AS/A Level PsychologyMolly Marshall-12%Preț: 91.48 lei103.43 lei -
Python Scripting for Computational ScienceHans Petter LangtangenPreț: 472.74 lei -
-4%Preț: 466.32 lei485.74 lei
Public țintă
Lower undergraduateCuprins
Part 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.
Recenzii
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)
“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)
Textul de pe ultima copertă
Computation lies at the heart of modern digital technology and our increasingly advanced information society. The theory of computation describes what tasks can and cannot be computed, and how efficiently the computable tasks can be computed.
This focused and accessible guide/textbook presents a thorough foundation to the theory of computation, whilst also providing a deeper insight for those looking to pursue research in this field. 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. Self-contained and supported by practical examples, the text is suitable for a one- or two-semester undergraduate course in the theory of computation.
Topics and features:
Dr. Akira Maruoka is a professor in the Faculty of Science and Engineering at Ishinomaki Senshu University,Japan.
This focused and accessible guide/textbook presents a thorough foundation to the theory of computation, whilst also providing a deeper insight for those looking to pursue research in this field. 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. Self-contained and supported by practical examples, the text is suitable for a one- or two-semester undergraduate course in the theory 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
Dr. Akira Maruoka is a professor in the Faculty of Science and Engineering at Ishinomaki Senshu University,Japan.
Caracteristici
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 Includes supplementary material: sn.pub/extras