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  - PS UNIKEB; Includes bibliographical references (p. 641-647) and index; 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
UR  - http://www.loc.gov/catdir/toc/ecip055/2004030342.html
ER  -