| 000 | 02413nam a2200325Ia 4500 | ||
|---|---|---|---|
| 003 | OSt | ||
| 005 | 20240813104351.0 | ||
| 008 | 240709s9999 xx 000 0 und d | ||
| 020 | _a9788131720479 | ||
| 040 | _cIISER-BPR | ||
| 041 | _aENG | ||
| 082 |
_a511.3 _bHOP _223rd |
||
| 100 | _aHopcroft, John E. | ||
| 222 | _aMathematics | ||
| 245 | 0 | _aIntroduction to automata theory, languages and computation | |
| 250 | _a3rd ed. | ||
| 260 |
_aNoida: _bPearson India Education Services Pvt. Ltd, _cc2008. |
||
| 300 |
_axvi, 487p. : _bill, pbk. ; _c22cm. |
||
| 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. Features :- *Presents theoretical concepts in a concise and accessible style. *Emphasizes modern applications of the theory *Uses numerous figures to help convey ideas *Provides more detail and intuition for definitions and proofs *Challenges readers with extensive exercises at various levels of difficulty at the end of each chapter *Includes additional practice and tests comprehension of important concepts withGradiance an online homework and tutorial system. Also includes illustrations, bibliographic references to chapters and index. | ||
| 650 | _aMathematical Logic | ||
| 650 | _aAutomata Theory | ||
| 650 | _aLanguages | ||
| 650 | _aComputation | ||
| 700 | _aMotwani, Rajeev | ||
| 700 | _aUllman, Jeffrey D. | ||
| 942 |
_cBK _2ddc |
||
| 942 | _2ddc | ||
| 947 | _a930 | ||
| 948 | _a0.22 | ||
| 999 |
_c4119 _d4119 |
||