Note: This is the 2019–2020 eCalendar. Update the year in your browser's URL bar for the most recent version of this page, or jump to the newest eCalendar.
Overview
Computer Science (Sci) : Finite automata, regular languages, context-free languages, push-down automata, models of computation, computability theory, undecidability, reduction techniques.
Terms: Fall 2019
Instructors: Crepeau, Claude (Fall)
3 hours
Prerequisite: COMP 251.
