000 04824nam a22003735i 4500
001 291129
003 MX-SnUAN
005 20160429154832.0
007 cr nn 008mamaa
008 150903s2009 xxk| o |||| 0|eng d
020 _a9781848824973
_99781848824973
024 7 _a10.1007/9781848824973
_2doi
035 _avtls000344454
039 9 _a201509030407
_bVLOAD
_c201405050307
_dVLOAD
_y201402061257
_zstaff
040 _aMX-SnUAN
_bspa
_cMX-SnUAN
_erda
050 4 _aQA75.5-76.95
100 1 _aSingh, Arindama.
_eautor
_9322275
245 1 0 _aElements of Computation Theory /
_cby Arindama Singh.
264 1 _aLondon :
_bSpringer London,
_c2009.
300 _axiv, 422 páginas 94 ilustraciones
_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
490 0 _aTexts in Computer Science,
_x1868-0941
500 _aSpringer eBooks
505 0 _aMathematical Preliminaries -- Regular Languages -- Equivalences -- Structure of Regular Languages -- Context-free Languages -- Structure of CFLs -- Computably Enumerable Languages -- A Noncomputably Enumerable Language -- Algorithmic Solvability -- Computational Complexity.
520 _aAs Computer Science progressively matures as an established discipline, it becomes increasingly important to revisit its theoretical foundations, learn the appropriate techniques for answering theory-based questions, and build one’s confidence in implementing this knowledge when building computer applications. Students well-grounded in theory and abstract models of computation can excel in computing’s many application arenas. Through a deft interplay of rigor and intuitive motivation, Elements of Computation Theory comprehensively, yet flexibly provides students with the grounding they need in computation theory. The book is self-contained and introduces the fundamental concepts, models, techniques, and results that form the basic paradigms of computing. Readers will benefit from the discussion of the ideas and mathematics that computer scientists use to model, to debate, and to predict the behavior of algorithms and computation. Previous learning about set theory and proof by induction are helpful prerequisites. Topics and features: • Contains an extensive use of definitions, proofs, exercises, problems, and other pedagogical aids • Supplies a summary, bibliographical remarks, and additional (progressively challenging) problems in each chapter, as well as an appendix containing hints and answers to selected problems • Reviews mathematical preliminaries such as set theory, relations, graphs, trees, functions, cardinality, Cantor’s diagonalization, induction, and the pigeon-hole principle • Explores regular languages, covering the mechanisms for representing languages, the closure properties of such languages, the existence of other languages, and other structural properties • Investigates the class of context-free languages, including context-free grammars, Pushdown automata, their equivalence, closure properties, and existence of non-context-free languages • Discusses the true nature of general algorithms, introducing unrestricted grammars, Turing machines, and their equivalence • Examines which tasks can be achieved by algorithms and which tasks can’t, covering issues of decision problems in regular languages, context-free languages, and computably enumerable languages • Provides a concise account of both space and time complexity, explaining the main techniques of log space reduction, polynomial time reduction, and simulations • Promotes students' confidence via interactive learning and motivational, yet informal dialogue • Emphasizes intuitive aspects and their realization with rigorous formalization Undergraduate students of computer science, engineering, and mathematics will find this core textbook ideally suited for courses on the theory of computation, automata theory, formal languages, and computational models. Computing professionals and other scientists will also benefit from the work’s accessibility, plethora of learning aids, and motivated exposition. Dr. Arindama Singh is a professor at the Department of Mathematics of the Indian Institute of Technology Madras and has authored books on logic for computer science.
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:
_z9781848824966
856 4 0 _uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-1-84882-497-3
_zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942 _c14
999 _c291129
_d291129