Sudkamp, Thomas A. <br/><br/>
Languages and machines  an introduction to the theory of computer science /  [[Book] :] 
Thomas A. Sudkamp. 
 - 3rd ed. 
 - Boston :  Pearson Addison-Wesley,  c2006. 
 - xvii, 654 p. :  ill. ;  24 cm. 
<br/><br/>Includes bibliographical references (p. 641-647) and index. 
<br/><br/>Mathematical preliminaries -- Languages -- Context-free grammars -- Normal forms for context-free grammars -- Finite automata -- Properties of regular languages -- Pushdown automata and context-free languages -- Turing machines -- Turing computable functions -- The Chomsky hierarchy -- Decision problems and the church-turing thesis -- Undecidability -- Mu-recursive functions -- Time complexity -- P, NP and Cook's theorem -- NP-complete problems -- Additional complexity classes -- Parsing : an introduction -- LL(k) grammars -- LR(k) grammars. 
<br/><br/> All Ages. 
<br/><br/><label>ISBN: </label>0321322215  
<br/><br/><label>LCCN: </label>2004030342 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Formal languages.<br/>Machine theory.<br/>Computational complexity.
<br/><br/><label>LC Class. No.: </label>QA267.3  / .S83 2006 
<br/><br/><label>Dewey Class. No.: </label>511.3 
<br/><br/><label>National Library of Medicine Call No.: </label> / SL