Mishra, K.L.P  <br/><br/>
Theory of computer science   : automata, languages and computation  
K.L.P. Mishra & N. Chandrasekaran  
 - 3rd ed.  
 - Delhi   PHI learning   2022 
 - xiii, 422  P.B  
<br/><br/> Preface. Notations. 1. Propositions and Predicates. 2. Mathematical Preliminaries. 3. The Theory of Automata. 4. Formal Languages. 5. Regular Sets and Regular Grammars. 6. Context-Free Languages. 7. Pushdown Automata. 8. LR(k) Grammars. 9. Turing Machines and Linear Bounded Automata. 10. Decidability and Recursively Enumerable Languages. 11. Computability. 12. Complexity. Answers to Self-Tests. Solutions (or Hints) to Chapter-end Exercises. Further Reading. Index.<br/><br/> 
<br/><br/><label>ISBN: </label>9788120329683  495 
<br/><br/><label>Subjects--Topical Terms: </label><br/>COMPUTER SCIENCE 
<br/><br/><label>Dewey Class. No.: </label>004.01 MIS(THE)Ed3