000			03269nam a22004335i 4500
001			978-0-387-32520-0
003			DE-He213
005			20250710083949.0
007			cr nn 008mamaa
008			100301s2006 xxu| s |||| 0|eng d
020			_a9780387325200 _a99780387325200
024	7		_a10.1007/0-387-32520-4 _2doi
082	0	4	_a004.0151 _223
100	1		_aGopalakrishnan, Ganesh. _eauthor.
245	1	0	_aComputation Engineering _h[recurso electrónico] : _bApplied Automata Theory and Logic / _cby Ganesh Gopalakrishnan.
264		1	_aBoston, MA : _bSpringer US, _c2006.
300			_aXXXV, 471 p. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_arecurso en línea _bcr _2rdacarrier
347			_atext file _bPDF _2rda
505	0		_aMathematical Preliminaries -- Cardinalities and Diagonalization -- Binary Relations -- Mathematical Logic, Induction, Proofs -- Dealing with Recursion -- Strings and Languages -- Machines, Languages, DFA -- NFA and Regular Expressions -- Operations on Regular Machinery -- The Automaton/Logic Connection, Symbolic Techniques -- The 'Pumping' Lemma -- Context-free Languages -- Push-down Automata and Context-free Grammars -- Turing Machines -- Basic Undecidability Proofs -- Advanced Undecidability Proofs -- Basic Notions in Logic including SAT -- Complexity Theory and NP-Completeness -- DFA for Presburger Arithmetic -- Model Checking: Basics -- Model Checking: Temporal Logics -- Model Checking: Algorithms -- Conclusions.
520			_a"This classroom-tested undergraduate textbook is unique in presenting logic and automata theory as a single subject...I highly recommend this book to you as the best route I know into the concepts underlying modern industrial formal verification." - Dr. Michael J.C. Gordon FRS, The University of Cambridge Computer Laboratory "This is a valuable book in my opinion. I learned a good deal from reading it, and encountered many attractive topic treatments and fresh insights, throughout. I certainly plan to add it to my reference shelf and recommend it to my students and colleagues. It covers automata in depth, providing good intuitions along the way, and culminating with applications that are used every day in the field. In this respect, it is a departure from the conventional textbooks on complexity and computability, although these 'tradtional' aspects remain well represented. The book is well organized for coordinated use in several courses, ranging from core udnergraduate to senior and graduate level topics." - Professor Steven D. Johnson, Indiana University
650		0	_aCOMPUTER SCIENCE.
650		0	_aINFORMATION THEORY.
650		0	_aSYSTEMS ENGINEERING.
650	1	4	_aCOMPUTER SCIENCE.
650	2	4	_aTHEORY OF COMPUTATION.
650	2	4	_aCIRCUITS AND SYSTEMS.
650	2	4	_aMATHEMATICAL LOGIC AND FORMAL LANGUAGES.
650	2	4	_aELECTRONIC AND COMPUTER ENGINEERING.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9780387244181
856	4	0	_uhttp://dx.doi.org/10.1007/0-387-32520-4 _zVer el texto completo en las instalaciones del CICY
912			_aZDB-2-SCS
942			_2ddc _cER
999			_c57184 _d57184