- Sipser, Michael.
- 3rd ed. - Boston, MA : Cengage Learning, c2013.
- Description
- Book — xxii, 458 p. : ill ; 24 cm.
- Summary
-
- 1. Regular languages
- 2. Context-free languages
- 3. The Church-Turing thesis
- 4. Decidability
- 5. Reducibility
- 6. Advanced topics in computability theory
- 7. Time complexity
- 8. Space complexity
- 9. Intractability
- 10. Advanced topics in complexity theory.
- Online
Engineering Library (Terman)
| Engineering Library (Terman) | Status |
|---|---|
| On reserve: Ask at Engineering circulation desk | |
| QA267 .S56 2013 | Unknown 2-hour loan |
| QA267 .S56 2013 | Unknown 2-hour loan |
CS-103-01, CS-154-01
- Course
- CS-103-01 -- Mathematical Foundations of Computing
- Instructor(s)
- Keith Schwarz
- Course
- CS-154-01 -- Introduction to the Theory of Computation
- Instructor(s)
- Omer Reingold
