Title:  Theory of Computing  
Instructor:  Cezar Câmpeanu  
Email:  ccampeanu < at > upei < dot > ca  
Office:  CASS 408  
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 1:002:15, MB 116  
Office Hours:  Monday 3:004:00, Tuesday 11:3012:30, Thursday 11:3012:30 or anytime by appointment (please send email)  
Midterm: 
Tuesday, March 4, 2014


Final Exam: 
Thursday, April 10th at 2:00 pm YSC GYM


Final MARKS: 
Everything Marked Please check your marks. They will be submitted to Registar's Office later, today.


Have a nice Summer!


ACADEMIC HONESTY:  This course is committed to the principle of academic integrity. Submitted work is expected to reflect an individual effort. Copying or cheating on assignments or tests will be dealt with harshly. Students should read Academic Regulation 20 in the UPEI Calendar at page 61 (http://files.upei.ca/calendar.pdf).  
Avoiding Plagiarism:  The following link will help you identify and. avoid plagiarism http://resources.library.upei.ca/plagiarism/index.htm.  
Individual Work Expectations:  You are expected to write your own code, your own proofs, your own examples, and so on. Unless explicitly specified in the assignment's text, the submitted work should be all yours.  
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.  