Introduction to Theory of Computation
Anil Maheshwari and Michiel Smid

@article{,
title= {Introduction to Theory of Computation},
journal= {},
author= {Anil Maheshwari and Michiel Smid},
year= {2014},
url= {http://cg.scs.carleton.ca/~michiel/TheoryOfComputation/},
license= {CC-SA},
abstract= {This is a free textbook for an undergraduate course on the Theory of Computation, which we have been teaching at Carleton University since 2002. Until the 2011/2012 academic year, this course was offered as a second-year course (COMP 2805) and was compulsory for all Computer Science students. Starting with the 2012/2013 academic year, the course has been downgraded to a third-year optional course (COMP 3803).
We have been developing this book since we started teaching this course. Currently, we cover most of the material from Chapters 2?5 during a 12-week term with three hours of classes per week.
The material from Chapter 6, on Complexity Theory, is taught in the third-year course COMP 3804 (Design and Analysis of Algorithms). In the early years of COMP 2805, we gave a two-lecture overview of Complexity Theory at the end of the term. Even though this overview has disappeared from the course, we decided to keep Chapter 6. This chapter has not been revised/modified for a long time.},
keywords= {},
terms= {},
superseded= {}
}