000			01118nam a22001817a 4500
005			20220822122121.0
008			211208b ||||| |||| 00| 0 eng d
020			_a9788131525296
082			_a511.35 _bSIP
100			_a Sipser, Michael
245			_aIntroduction to the theory of computation _c Michael Sipser
250			_a3RD
260			_aAustralia : _b Cengage Learning, _c©2013
300			_a458P:
505			_t1. Regular Languages. _t2. Context-Free Languages. _t3. The Church-Turing Thesis. _t4. Decidability. _t5. Reducibility. _t6. Advanced Topics in Computability Theory. _t7. Time Complexity. _t8. Space Complexity. _t9. Intractability. _t10. Advanced Topics in Complexity Theory
520			_aMichael Sipser's emphasis on unifying computer science theory - rather than offering a collection of low-level details - sets the book apart, as do his intuitive explanations. Throughout the book, Sipser builds students' knowledge of conceptual tools used in computer science, the aesthetic sense they need to create elegant systems, and the ability to think through problems on their own
942			_2ddc _cBK
999			_c1329 _d1329