Number of hours
- Lectures 13.5
- Projects -
- Tutorials 13.5
- Internship -
- Laboratory works -
- Written tests -
ECTS
ECTS 3.0
Goal(s)
Introduction to finite automaton.
This course gives the basis of finite automaton theory and practice.
The goal is to allow the student to be able to use correctly this fundamental model when he is in his enterprise.
Responsible(s)
Sylvain BOULME
Content(s)
Finite Automata
- Regular languages defintiion
- Models: finite automata and regular expressions
- Algorithms: determinisation and minimisation
- Modèls limits : pumping lemma
- Application to problem solving
- This course is given during the First academic period **
None.
Test
Evaluation : Examen Ecrit (2h)
Resit : Examen Ecrit (2h)
First session:
2h written examination.
All written document available.
Second session:
2h written examination.
All written document available.
Calendar
The course exists in the following branches:
- Curriculum - Work Study Education - Alternance 1ere annee
Additional Information
Course ID : 3MM1AF
Course language(s): 
The course is attached to the following structures:
- Team Theoretical computer science
You can find this course among all other courses.
Bibliography
- Introduction to automata theory, languages, and computation de Hopcroft, Motwani & Ullman (2007)