Hopcroft, John E. <br/><br/>
Introduction to automata theory, languages, and computation 

 - 3rd 
 - Noida  Pearson Education  2008 
 - xvi, 487pg.  | Binding - Paperback | 
<br/><br/> This 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.<br/><br/><br/>  <br/>CONTENT:<br/>Automata: The Methods and the Madness<br/>Finite Automata<br/><br/>Regular Expressions and Languages<br/>Properties of Regular Languages<br/>Context-Free Grammars and Languages<br/><br/>Pushdown Automata<br/><br/>Properties of Context-Free Languages<br/>Introduction to Turing Machines<br/>Undecidability<br/>Intractable Problems<br/><br/>Additional Classes of Problems<br/>Index 
<br/><br/><label>ISBN: </label>9788131720479 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Computer Engineering
<br/><br/><label>Subjects--Index Terms: </label>Finite Automata Context-Free Grammars and Languages Undecidability Pushdown Automata 
<br/><br/><label>Dewey Class. No.: </label>006.3  / HOP/MOT