Number of hours
- Lectures 15.0
- Projects -
- Tutorials 10.5
- Internship -
- Laboratory works -
- Written tests -
ECTS
ECTS 3.0
Goal(s)
At the end of the course, the student should be able to:
- understand and use operations on languages;
- formalize automatic computations;
- understand the fundamental limits of computers;
- explain the typology of a language;
- build a syntactical tree.
Responsible(s)
Vincent GUISSE
Content(s)
1) Languages and regular expressions
2) Finite automata
3) Grammars
4) Pushdown automata
5) Turing machines
Test
E1: exam (1st session)
E2: exam (2nd session)
CC: homework assignment
Calendar
The course exists in the following branches:
- Curriculum - Network and computer science - Semester 6
- Curriculum - EIS - Semester 6
Additional Information
Course ID : 3AMCS322
Course language(s):
The course is attached to the following structures:
- Team Computer Science
You can find this course among all other courses.
Bibliography
- Introduction à la Calculabilité: Cours et Exercices Corrigés, Pierre Wolper. Dunod, 2001.
- Introduction to the Theory of Computation. Second (International), Michael Sipser. Edition, Thomson Course Technology, 2005.
- Introduction to Automata Theory, Languages, and Computation, John E. Hopcroft, Rajeev Motwani, and Jeffrey D. Ullman, . Second Edition, Addison-Wesley, 2001.