| 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://catalogue.pearsoned.ca/educator/product/Introduction-to-Automata-Theory-Languages-and-Computation/9780321455369.page | |
| Textbook Stanford web site: | http://www-db.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: 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, CSH 104 | |
| Office Hours: | Tuesday, Wednesday, Thursday 1:00-2: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. | ||||||