Number of hours
- Lectures 16.5
- Projects -
- Tutorials 15.0
- Internship -
- Laboratory works 1.5
- Written tests -
ECTS
ECTS 3.0
Goal(s)
The formal language theory course develops mathematical concepts and techniques that are foundational to computer science. This course introduces the fundamental definitions and methods associated with artificial languages, typically programming languages. It is a prerequisite to most of the computer science courses that are given during the following semesters at Ensimag.
Responsible(s)
Lionel RIEG
Content(s)
- Introduction to formal language theory
- Regular languages: finite state automata, algorithms on automata, closure properties for regular languages, Kleene lemma
- Handling formal grammars: Chomsky hierarchy, derivation trees, ambiguity, proofs on grammars
none
Test
A written exam lasting 2 hours and a small project
- MCC en présence
N1 = 1/4 contrôle continu + 3/4 examen écrit
- MCC à distance
N1 = 1/3 contrôle continu à distance + 2/3 (devoir à la maison ou examen en temps limité à la maison)
- Seconde session
N2 = 1/4 contrôle continu + 3/4 examen écrit de rattrapage
Calendar
The course exists in the following branches:
- Curriculum - Core curriculum - Semester 5
Additional Information
Course ID : 3MMTL1
Course language(s): 
The course is attached to the following structures:
You can find this course among all other courses.
Bibliography
P. Berlioux, M. Echenim, M. Lévy : Théorie des langages, polycopié Ensimag
J.E. Hopcroft, R. Motwani, J.D. Ullman : Introduction to Automata Theory, Languages, and Computation, 3/E, Addison-Wesley, 2006