Title:  Theory of Computing  
Instructor:  Cezar Câmpeanu  
Email:  ccampeanu < at > upei < dot > ca  
Office:  CASS 405  
Tel:  (902)5660485  
Textbook: 
Introduction to Automata Theory, Languages, and Computation 3rd Edition, by John E. Hopcroft, Rajeev Motwani, and Jeffrey D. Ullman Addison Wesley, 2007, ISBN 13: 9780321462251 ISBN 10: 0321462254 

Textbook web site:  http://catalogue.pearsoned.ca/educator/product/IntroductiontoAutomataTheoryLanguagesandComputation/9780321455369.page  
Textbook Stanford web site:  http://wwwdb.stanford.edu/~ullman/ialc.html  
Course web site: 
Go To: http://www.csit.upei.ca, 

Recommended reading:  Handbook of Formal Languages Vols. 1  3 Rozenberg, Grzegorz; Salomaa, Arto (Eds.) 1997, LXVIII, 2051 p. 272 illus., Hardcover ISBN: 3540614869  
General description:  This course introduces automata theory, formal languages and computability. Topics include: finite automata, regular expressions, contextfree and contextsensitive languages, Turing machines, recursive functions, recursive and recursivelyenumerable sets, and unsolvable and intractable problems.  
Time and Location:  Tuesday and Thursday 10:0011:15, CSH 104  
Office Hours:  Tuesday, Wednesday, Thursday 1:002:00 or anytime by appointment (please send email)  
Midterm: 
Tuesday, October 30, 2012


Final Exam: 
Friday, December 7 at 7:00 pm, MB 420


Grading scheme: 


Course Resources:  
Note:  Second year students and up that are interested in marking, please check with Rita Stanley or Chris Vessey. They must fill out an application.  