Theoretical computer science - 3AMCS322
A+Augmenter la taille du texteA-Réduire la taille du texteImprimer le documentEnvoyer cette page par mail
Goals
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.
Content 1) Languages and regular expressions
2) Finite automata
3) Grammars
4) Pushdown automata
5) Turing machines
Tests E1: exam (1st session)
E2: exam (2nd session)
CC: homework assignment
Additional Information Course ID : 3AMCS322
Course language(s): 
The course is attached to the following structures:
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.
A+Augmenter la taille du texteA-Réduire la taille du texteImprimer le documentEnvoyer cette page par mail
Date of update June 25, 2015