TY  - BOOK
AU  - Sipser,Michael
TI  - Introduction to the theory of computation
SN  - 9781133187790
AV  - QA267  .S56 2013
U1  - 511.35 SI.I 2013 23
PY  - 2013///
CY  - Boston, MA
PB  - Cengage Learning
KW  - Machine theory
KW  - Computational complexity
N1  - Includes bibliographical references (pages 443-447) and index; Part 1: Automata and languages 1. Regular languages ; 2. Context-free languages -- Part 2: Computability theory. 3. The Church-Turing thesis ; 4. Decidability ; 5. Reducibility ; 6. Advanced topics in computability theory -- Part 3: Complexity theory. 7. Time complexity ; 8. Space complexity ; 9. Intractability ; 10. Advanced topics in complexity theory
N2  - Gain a solid understanding of the fundamental mathematical properties of computer hardware, software, and applications with a blend of practical and philosophical coverage and mathematical treatments, including advanced theorems and proofs. This books comprehensive coverage makes it a valuable reference for studies in theoretical computing
ER  -