|
|
Title:
|
|
Theory of Computing
|
|
|
|
|
|
Instructor:
|
|
Cezar Câmpeanu
|
|
|
|
|
|
Email:
|
|
ccampeanu < at > upei < dot > ca
|
|
|
|
|
|
Office:
|
|
CASS 405
|
|
|
|
|
|
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:
|
|
http://vig.pearsoned.ca/catalog/academic/product/0,1144,0321462254,00.html
|
|
|
|
|
|
Textbook Stanford web site:
|
|
http://www-db.stanford.edu/~ullman/ialc.html
|
|
|
|
|
|
Course web site:
|
|
Go To: http://www.csit.upei.ca,
or
http://www.upei.ca/csit,
Then follow the links: Faculty, Cezar Campeanu, Personal Webpage, Teaching, and CS332 under Winter 2010
|
|
|
|
|
|
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.
|
|
|
|
|
|
Time and Location:
|
|
Tuesday and Thursday 10:00-11:15, M 320
|
|
|
|
|
|
Office Hours:
|
|
Monday 11:00-12:00, 1:30-2:45, Tuesday: 11:30-12:30, 2:30-3:15 Thursday: 11:30-12:30, 2:30-3:15 or anytime by appointment (please send email-)
|
|
|
|
|
|
Final Exam:
|
|
Wednesday, April 7 at 9:00 am, M 220
|
|
|
|
|
|
Final MARKS:
|
|
Everything Marked
Please check your marks. They will be submitted to Registar's Office on Friday April 16, 2010. Have a nice Summer!
|
|
|
|
|
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.
