Languages and machines : an introduction to the theory of computer science /
Sudkamp, Thomas A.
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. ; 24 cm.
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.
0321322215 (alk. paper) RM380.76
Formal languages.
Machine theory.
Computational complexity.
QA267.3 / .S83 2006
511.3
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. ; 24 cm.
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.
0321322215 (alk. paper) RM380.76
Formal languages.
Machine theory.
Computational complexity.
QA267.3 / .S83 2006
511.3