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 Stanford web site:  http://wwwdb.stanford.edu/~ullman/ialc.html  
Course web site: 
Go To: http://www.smcs.upei.ca/~ccampeanu, 

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.  
PREREQUISITE:  CS 261 and Math 242  
Essential to review:  Set theory, Mathematical Logic, including boolean algebras, Induction, Arithmetic/Number Theory (mainly Modular Arithmetic).  
Time and Location:  Monday/Wednesday/Friday 9:30  10:20, CSH 104  
Office Hours:  Monday 12:302:20, anytime by appointment (please send email)  
Midterm:  Wednesday, February 28, 2018, during class  
Final Exam: 
Saturday, April 14, at 9:00 am Health Science Building 105


Final MARKS: 
Everything Marked Please check your marks. They will be submitted to Registar's Office on Friday April 20, 2018.


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:  
Important Notices:  Please, check course web site periodically for updates. For any problems concerning the CS332 pages, please contact me.  