Computer Science/Math 332
September 2015

Title:   Theory of Computing
Instructor:   Cezar Câmpeanu
Email:   ccampeanu < at > upei < dot > ca
Office:   CASS 408
Tel:   (902)566-0485
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: 978-0321-46225-1
ISBN 10: 0-321-46225-4
Textbook web site:
Textbook Stanford web site:
Course web site:  

Go To:,
Then follow the links: Faculty, Cezar Campeanu, Personal Webpage, Teaching, and CS332 under Fall 2015

Recommended reading:   Handbook of Formal Languages Vols. 1 - 3 Rozenberg, Grzegorz; Salomaa, Arto (Eds.) 1997, LXVIII, 2051 p. 272 illus., Hardcover ISBN: 3-540-61486-9
General description:   This course introduces automata theory, formal languages and computability. Topics include: finite automata, regular expressions, context-free and context-sensitive languages, Turing machines, recursive functions, recursive and recursively-enumerable 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:   Tuesday and Thursday 10:00-11:15, CSH 104
Office Hours:   Tuesday and Thursday 11:30-12:30, Friday 12-13, or anytime by appointment (please send email-)
Thursday, October 29, 2015
Final Exam:  
Wednesday, December 9 at 9:00 am, McDougall Hall 246
Final MARKS:  
Everything Marked

Please check all your marks. They will be submitted to Registar's Office, on Friday (before 11am).
Merry Christmas and a A Happy New Year!
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 104 (
Avoiding Plagiarism:   The following link will help you identify and. avoid plagiarism
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:
Assignments Midterm Examination Final Examination
36% 29% 35%
Course Resources:
  1. Assignments
  2. Handouts
  3. Assignment Policy
  4. Tentative Schedule
  5. Moodle Login
  6. Grail
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.
To make sure you are viewing the most recent version of this page,press the shift key while clicking on the Reload button.
It is your responsibility to check this page for updates.

Last modified:Tuesday September 05, 2017 at 09:17 am ADT
Cezar Câmpeanu