Linz, Peter <br/><br/>
Introduction to formal languages and automata 
 Introduction to formal languages & automata 
Peter Linz. 
 - 6th ed., 
 - New delhi,  Jones and Bartlett India pvt.ltd,  2018 
 - 449p,  23cm., 
<br/><br/> Introduction to the theory of computation --<br/>  Finite automata --<br/>  Regular languages and regular grammars --<br/>  Properties of regular languages --<br/>  Context-free languages --<br/>  Simplification of context-free grammars  and Normal Forms--<br/>  Pushdown automata --<br/>  Properties of context-free languages --<br/>  Turing machines --<br/>  Other models of Turing machines --<br/>  A hierarchy of formal languages and automata --<br/>  Limits of algorithmic computation --<br/>  Other models of computation --<br/>  An overview to computational complexity. 
<br/><br/> Formal languages, automata, computability, and related matters form the major part of the theory of computation. This textbook is designed for an introductory course for computer science and computer engineering majors who have knowledge of some higher-level programming language, 
<br/><br/><label>ISBN: </label>9789384323219 
<br/><br/><label>Subjects--Topical Terms: </label><br/>	 Formal languages.<br/> Machine theory.
<br/><br/><label>Dewey Class. No.: </label>519.736  / LIN