TY  - BOOK
AU  - Sudkamp,Thomas A
TI  - Languages and machines: an introduction to the theory of computer science 
SN  - 0321322215 (alk. paper)
AV  - QA267.3 .S83 2006
U1  - 511.3 22
PY  - 2006///
CY  - Boston
PB  - Pearson/Addison-Wesley
KW  - Formal languages
KW  - Machine theory
KW  - Computational complexity
N1  - Includes bibliographical references (p. 641-647) and indexes; 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
ER  -