Note: This is the 2016–2017 edition of the eCalendar. Update the year in your browser's URL bar for the most recent version of this page, or click here to jump to the newest eCalendar.
Offered by: Computer Science (Faculty of Science)
Computer Science (Sci) : Finite automata, regular languages, context-free languages, push-down automata, models of computation, computability theory, undecidability, reduction techniques.
Terms: Fall 2016
Instructors: Hatami, Hamed (Fall)
Prerequisite: COMP 251 and MATH 240.