000			01991 a2200277 4500
005			20260416110211.0
008			260416b |||||||| |||| 00| 0 eng d
020			_a9788131720479
040			_aCSL _cCSL
041			_2eng _aeng
084			_aD65,8(B) P8-;11 FT _qCSL
100			_aHopecroft, John E. _9862009 _eauthor
245			_aIntroduction to Automata theory, Languages, and Computation
250			_a3rd
260			_aNoida : _bPearson, _c2025.
300			_axvi, 487p. _b: ill. _c; 23 cm.
500			_aincludes Index and references
520			_aThis classic book on formal languages, automata theory, and computational complexity has been updated to present theoretical concepts in a concise and straightforward manner with the increase of hands-on, practical applications. This new edition comes with Gradiance, an online assessment tool developed for computer science. Gradiance is the most advanced online assessment tool developed for the computer science discipline. With its innovative underlying technology, Gradiance turns basic homework assignments and programming labs into an interactive learning experience for students. By using a series of “root questions” and hints, it not only tests a student's capability, but actually simulates a one-on-one teacher-student tutorial that allows for the student to more easily learn the material. Through the programming labs, instructors are capable of testing, tracking, and honing their students' skills, both in terms of syntax and semantics, with an unprecedented level of assessment never before offered.
650			_aFinite automata _91234913
650			_aProperties of regular language _91234914
650			_aPushdown automata _91234915
650			_aIntractable problems _91234916
700			_aMotwani, Rajeev _eauthor _91234917
700			_aUllman, Jeffrey D. _eauthor _91234918
942			_cTEXL _2CC _e3rd _hD65,8(B) P8-;11 FT
999			_c1466951 _d1466951