000 01360cam a22002894a 4500
008 081026s2006 maua b 001 0 eng
010 _a2006271030
020 _a0534950973
020 _a9780619217648
035 _a(Sirsi) u945
920 _a0619217642
040 _aEG-CaNU
_cEG-CaNU
_dEG-CaNU
042 _ancode
082 0 0 _a511.35
_2 22
100 1 _aSipser, Michael.
_916937
245 1 0 _aIntroduction to the theory of computation /
_c Michael Sipser.
250 _a2nd ed.
260 _aBoston :
_b Thomson Course Technology,
_c2006.
300 _axix, 431 p. :
_b ill. ;
_c 25 cm.
504 _aIncludes bibliographical references (p. 415-419) and index.
505 0 _aIntroduction 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 Selected Bibliography
520 3 _aThis market leading text on computational theory provides a mathematical treatment of computer science theory designed around theorems and proofs.
630 0 0 _aBioinformatics.
_9475
650 0 _aMachine theory.
_916939
650 0 _aComputational complexity.
_9993
596 _a1
999 _c8387
_d8387