CSI 3504
Introduction aux langages formels
Hiver 2017
Topics
- Recursive definitions
- Regular expressions
- Finite automata and transition graphs
- Kleene theorem and nondeterminism
- Sequential machines
- Regular and nonregular languages
- Decidability
- Context-free grammars
- Pushdown automata
- Parsing
- Turing machines and recursively enumerable languages
Readings
- Introduction to Computer Theory
- Cohen chapters 1–19 and 23, selected sections.
Sources
- Course catalogue ↗2026–2027
- instructor_course_page ↗Hiver 2017
- Historical French-language course page.