000			03092cam a2200397Ia 4500
001			u4435
003			SA-PMU
005			20210418123158.0
008			060630s2006 nyua b 001 0 eng d
010			_a 2006920602
040			_aOHX _cOHX _dTXH _dBAKER _dMUQ _dDLC _dYDXCP _dVRC _dNLGGC _dW2U _dHEBIS _dDEBBG
020			_a0387244182 (hd.bd.)
020			_a9780387244181 (hd.bd.)
020			_a0387325204 (e-isbn)
020			_a9780387325200 (e-isbn)
020			_a1441937412
020			_a9781441937414
035			_a(OCoLC)70249249 _z(OCoLC)710019944
050	0	0	_aQA76.9.M35 _bG67 2006
082	0	0	_a004.01/51 _222
100	1		_aGopalakrishnan, Ganesh.
245	1	0	_aComputation engineering : _bapplied automata theory and logic / _cGanesh Gopalakrishnan.
260			_aNew York, NY : _bSpringer, _cc2006.
300			_axxxv, 471 p. : _bill. ; _c25 cm.
504			_aIncludes bibliographical references (p. [453]-460) and index.
520			_aThe computer hardware and software industry is committed to using formal methods. As a result, it is crucial that students who take automata theory and logic courses retain what they have learned and understand how to use their knowledge. Yet many textbooks typically emphasize automata theory only, not logic, thus losing a valuable opportunity to tie these subjects together and reinforce learning. In fact, automata theory and logic evolved hand-in-hand, yet this connection was severed in the '70s as separate automata-theory and logic courses became possible. Now, with computer science departments suffering from overcrowded syllabi, it is often possible for undergraduates to get a BS without having had to take a course in mathematical logic! Today's students want to know how knowledge can work for them -- learning theory as a tool is preferable to learning theory for theory's sake. To prove that theoretical tenents are not only applicable, but also necessary and relevant, useful examples must be presented. This textbook uses interactive tools throughout, such as simple BDD and SAT tools. By providing a blend of theory and practical applications the material is shown to be both inviting and current. Topics are also illustrated in multiple domains so that information is reinforced and students can begin to tie automata theory and logic together. They will also learn multiple uses of fixed-points, including BDD based model checking and understanding context-free productions. Having used this book, students will not only know and understand automata theory, but also be able to apply their knowledge in real practice.
650		0	_aComputer science _xMathematics.
650		0	_aComputer logic.
650		0	_aMachine theory.
856	4	2	_3Publisher description _uhttp://catdir.loc.gov/catdir/enhancements/fy0663/2006920602-d.html
856	4	1	_3Table of contents only _uhttp://catdir.loc.gov/catdir/enhancements/fy0819/2006920602-t.html
856	4	2	_qtext/html _uhttp://deposit.ddb.de/cgi-bin/dokserv?id=2738013&prov=M&dok_var=1&dok_ext=htm _3Inhaltstext
942			_cBOOK
994			_aZ0 _bSUPMU
596			_a1 2
999			_c1919 _d1919