| 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: | 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.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 Winter 2021 |
|
| 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: | Web | |
| Office Hours: | on Zoom anytime by appointment # (please send email-) | |
| Midterm: |
Friday, March |
|
| Final Exam: |
Monday, April 19 at 2:00 pm AST Text Final submission Link
|
|
|
Please check your all your marks. They will be submitted to Registar's Office by the end of the day tomorrow April 27, 2021(if they are not already in).
|
||
|
Have a nice and safe 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: | TBA |
| Course Resources: | |
| Important Notices: | Please, check course web site periodically for updates. For any problems concerning the MCS3320 pages, please contact me. |