Finite State Automata - 3MM1AF

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.

First session:
2h written examination.
All written document available.

Second session:
2h written examination.
All written document available.

• • MCC en présentiel **
    N1 = examen écrit
    N2 = examen écrit

• • MCC en distanciel **
    N1 = devoir à la maison
    N2 = devoir à la maison

NP1 = N1
NB1 = NP1
NB2 = NB1
NFS1 = NB1
NR = N2
NFS2 = NR

The course exists in the following branches:

• Curriculum - Work Study Education - Alternance 1ere annee

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.

• Introduction to automata theory, languages, and computation de Hopcroft, Motwani & Ullman (2007)