an introduction to the theory of computer science Sudkamp, Thomas A. creator text bibliography mau Boston India Pearson Addison-Wesley c2006.[Impression 2009] 2009 2006 3rd ed. monographic eng

print

xvii, 654 p. : ill. ; 24 cm. 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. Thomas A. Sudkamp. Includes bibliographical references (p. 641-647) and index. Formal languages Machine theory Computational complexity 511.3 9788131714751 0321322215 (alk. paper) 2004030342 DLC 100928 13821912