References and Textbooks

Required text

"Course Notes for CSC B36/236, Introduction to the Theory of Computation", by Vassos Hadzilacos, 2003-2004 edition.

Download page 30 (in Adobe PDF); because of a printer's error, this page is missing from the book.

Additional references

• "Foundations of Computer Science", by A.V. Aho and J.D. Ullman, W.H. Freeman and Company, 1995.
  (Good for logic, induction, algorithm correctness, running times, asymptotic notation, recurrences, finite state automata and regular languages.)
• "Introduction to Algorithms", by Cormen, Lieserson, Rivest, Stein, McGraw-Hill, 2001.
  (Good for algorithm correctness, running times, asymptotic notation, recurrences -- but material presented quickly.)
• "Mathematical Logic: Applications and Theory", by J.E. Rubin, Saunders College Publishing, 19990.
  (Good for logic and some induction.)
• "How to Prove It", by D.J. Velleman, Cambridge University Press, 1994.
  (Good for logic, induction, general proof techniques.)

Go back to the menu (if your browser does not support frames).