Sudkamp, Thomas A <br/><br/>
Languages and machines :  an introduction to the theory of computer science / 
Thomas A. Sudkamp 
 - 3rd ed 
 - Boston :  Pearson/Addison-Wesley,  c2006 
 - xvii, 654 p. :  ill. ;  25 cm 
<br/><br/>Includes bibliographical references (p. 641-647) and indexes 
<br/><br/>Introduction -- 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/><label>ISBN: </label>0321322215 (alk. paper) 
<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  / STL