Martin, John C. <br/><br/>
Introduction to Languages and the Theory of Computation  

 - 3rd ed 
 - New Delhi :  McGraw-Hill,   ©2003. 
 - xiii, 543 pages :   illustrations ;   24 cm 
<br/><br/> Part.1 Mathematical Notation and Techniques --  Part.2 Regular Languages and Finite Automata --  Part.3 Context-Free Languages and Pushdown Automata --  Part.4 Turing Machines and Their Languages --  Part.5 Unsolvable Problems and Computable Functions --  Part.6 Introduction to Computational Complexity -- 
<br/><br/> Providing an introduction to the theory of computation, this work emphasizes formal languages, automata and abstract models of computation, and computability. It includes an introduction to computational complexity and NP-completeness. It also introduces the necessary mathematical tools in the context in which they are used. 
<br/><br/><label>ISBN: </label>9780070499393 007049939X 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Computable functions<br/>Sequential machine theory
<br/><br/><label>Dewey Class. No.: </label>004.519  / MAR