References and textbooks
Required textbook
- Michael Sipser:
Introduction to the Theory of Computation.
PWS Publishing Company (2005), ISBN: 0-534-95097-3.
Additional references
- Cormen, Leiserson, Rivest, Stein:
Introduction to Algorithm (2nd edition).
McGraw-Hill (2001), ISBN: 0-07-013151-1.
- Hopcroft, Ullman:
Introduction to Automata Theory, Languages, and Computation.
Addison-Wesley (1979), ISBN: 0-201-02988-X.
(For material on computational computability.)
- Garey, Johnson:
Computers and Intractability:
A Guide to the Theory of NP-Completeness.
W.H. Freeman (1979), ISBN: 0-7167-1045-5.
(For material on computational complexity.)