Options d’inscription
INF 302 introduces the theory of formal languages and finite-state automata,
together with the associated algorithms. The course covers deterministic and
non-deterministic finite-state automata, their composition operations,
determinization, $\epsilon$-transitions, minimization, regular expressions and
Kleene's theorem, regular grammars, and finally the limits of regularity through
the pumping lemma. Beyond this specific knowledge, the course trains students in
the mathematical modelling of computing problems, in the search for correct and
efficient solutions, and in writing rigorous proofs.
- Enseignant responsable de cours: Ylies Falcone
Les visiteurs anonymes ne peuvent pas accéder à ce cours. Veuillez vous connecter.