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

 - New Delhi :  Narosa Publication,  1987. 
 - ill.;  418 pages :  23 cm. 
<br/><br/> Finite automata and regular expressions --<br/>  Properties of regular sets --<br/>  Context-free grammars --<br/>  Pushdown automata --<br/>  Properties of context-free languages --<br/>  Turing machines --<br/>  Undecidability --<br/>  The Chomsky hierarchy --<br/>  Deterministic context-free languages --<br/>  Closure properties of families of languages --<br/>  Computational complexity theory --<br/>  Intractable problems --<br/>  Highlights of other important language classes. 
<br/><br/> This book presents automata theory, formal languages, and computational complexity as a coherent theory. It includes end-of-chapter questions, bibliographies, and exercises. Problems of highest and intermediate difficulty are marked respectively with double or single stars.  
<br/><br/><label>ISBN: </label>8185015961 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Machine theory<br/>Formal languages<br/>Computational complexity
<br/><br/><label>Dewey Class. No.: </label>629.831  / HOP