Automates
- Code : N5AN03D
In brief
Objectives
Understanding finite state automata and their relation to regular expressions
Description
Notion on computer languages. Definition of finite state automata. Use for system modeling. Non-determinism, determinism, minimization. Relationship with regular expressions.
Session 1 ou session unique - Contrôle des connaissances
| Modalité | Nature | Coefficient | Remarques |
|---|---|---|---|
| CT (contrôle terminal) | Ecrit | 100% | Examen Automates |
Session 2 - Contrôle des connaissances
| Modalité | Nature | Coefficient | Remarques |
|---|---|---|---|
| CT (contrôle terminal) | Ecrit | 100% | Examen Automates |
