Vue d'ensemble
Informatique (Sci) : Finite automata, regular languages, context-free languages, push-down automata, models of computation, computability theory, undecidability, reduction techniques.
Terms: Automne 2024, Hiver 2025
Instructors: Waldispuhl, J茅r么me (Fall) B茅rub茅-Valli猫res, Mathieu (Winter)
3 hours
Prerequisite: COMP 251.
