| 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: | https://www.pearson.com/en-ca/subject-catalog/p/introduction-to-automata-theory-languages-and-computation/P200000003517/9780321455369 | |
| Textbook Stanford web site: | http://www-db.stanford.edu/~ullman/ialc.html | |
| Other Recomended Textbook: |
Introduction to the Theory of Computation, third Edition, by Michael Spiser, 2013, ISBN 13: 978-1-133-18779-0 ISBN 10: 1-133-18779-X |
|
| Course web site: |
Go To: http://www.smcs.upei.ca/~ccampeanu, or http://www.upei.ca/smcs, and follow the links: Faculty Members, Cezar Câmpeanu, Personal Website. Then follow Teaching, and MCS3320 under Fall 2023 |
|
| 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: | CS2920 and Math 2420 | |
| Essential to review: | Set theory, Mathematical Logic, including boolean algebras, Induction, Arithmetic/Number Theory (mainly Modular Arithmetic). Trying to bypass MATH 2420 may have as a result failing MCS3320. | |
| Time and Location: | Monday/Wednesday/Friday 10:30 AM - 11:20 AM, SDU Main Bldg, 117 Lecture | |
| Office Hours: | MWF 11:20-12:20 or by appointment (please send email-) | |
| Midterm: | Friday, November 10, 2023, during class time(10:30-11:20) in PAC 110S. | |
| This course is taking place on the traditional and unceded territory of the Lnu Epekwitk (Island Mi'kmaq), a district of Mi'kma'ki, the Mi'kmaq Nation. | ||
| Academic Integrity Portal: | https://library.upei.ca/ai/home | |
| Academic Integrity Course: | https://moodle31.upei.ca/course/view.php?id=9071 | |
| 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 113 (http://files.upei.ca/calendar.pdf). | |
| The following link will help you to maintain academic integrity and avoid plagiarism https://library.upei.ca/ai/home. | ||
| 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. | |
| For some/all assignments/moodle resources and exams you may have to earn one or more academic integrity badges. | ||
| Grading scheme: |
|
||||||
| Course Resources: | |||||||
| Important Notices: | Please, check course web site periodically for updates. For any problems concerning the MCS3320 pages, please contact me. | ||||||