000 03807nam a22003615i 4500
001 280457
003 MX-SnUAN
005 20160429154025.0
007 cr nn 008mamaa
008 150903s2011 xxk| o |||| 0|eng d
020 _a9780857295354
_99780857295354
024 7 _a10.1007/9780857295354
_2doi
035 _avtls000333917
039 9 _a201509030242
_bVLOAD
_c201404130558
_dVLOAD
_c201404092347
_dVLOAD
_y201402041135
_zstaff
040 _aMX-SnUAN
_bspa
_cMX-SnUAN
_erda
050 4 _aQA75.5-76.95
100 1 _aMaruoka, Akira.
_eautor
_9305383
245 1 0 _aConcise Guide to Computation Theory /
_cby Akira Maruoka.
264 1 _aLondon :
_bSpringer London :
_bImprint: Springer,
_c2011.
300 _axvii, 281 páginas
_brecurso en línea.
336 _atexto
_btxt
_2rdacontent
337 _acomputadora
_bc
_2rdamedia
338 _arecurso en línea
_bcr
_2rdacarrier
347 _aarchivo de texto
_bPDF
_2rda
500 _aSpringer eBooks
505 0 _aPart 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.
520 _aComputation 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: 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 This hands-on and easy-to-read textbook/reference is ideal for undergraduate students of computer science and related disciplines needing to develop a deep understanding of this fascinating field, even if they have no prior knowledge of the subject. Dr. Akira Maruoka is a professor in the Faculty of Science and Engineering at Ishinomaki Senshu University, Japan.
590 _aPara consulta fuera de la UANL se requiere clave de acceso remoto.
710 2 _aSpringerLink (Servicio en línea)
_9299170
776 0 8 _iEdición impresa:
_z9780857295347
856 4 0 _uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-0-85729-535-4
_zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942 _c14
999 _c280457
_d280457