Automates
Objectives
To discover, understand and know how to exploit the mathematical tools necessary for the formal modeling of the dynamics of discrete systems and for the analysis of structured information: finite automata, stack automata and Turing machines. The subject covers both theoretical and practical aspects through the use of state-of-the-art tools for modeling discrete systems, and the use of formal description languages for the exploitation of structured information.
Description
Theoretical and practical study of :
Finite automata
Stacked automata
Structured information analysis techniques
Recursive top-down analysis
Generators of lexical and syntactic parsers
Targeted skills
Modeling the dynamics of discrete systems using finite automata.
Construction of structured information analysis tools from language models in the form of regular expressions and grammars.
Pre-requisites
Language theory (see the Modelling subject of the Modelling and Programming UE)
Session 1 ou session unique - Contrôle des connaissances
Modalité | Nature | Coefficient | Remarques |
---|---|---|---|
CC (contrôle continu) | Oral/Ecrit | 70% | Examen Automates |
CC (contrôle continu) | Bureau d'Etudes | 30% | BE-Automates |
Session 2 - Contrôle des connaissances
Modalité | Nature | Coefficient | Remarques |
---|---|---|---|
CC (contrôle continu) | Oral/Ecrit | 70% | Examen Automates |
CC (contrôle continu) | Bureau d'Etudes | 30% | BE-Automates |