THEORIE DES AUTOMATES ET DES LANGAGES, THEORIE DES GRAPHES

  • Voir la page en français

    In brief

  • ECTS credits : 5
  • Code : N7EN10

Objectives

The objective of the UE is twofold. The student must master the formalisms of finite automata, stack automata and Turing machine for the modeling of state based systems and the implementation of lexical and syntactic analyses. He is also introduced to the computability and complexity theories.
The student must also master the principal concepts and results of Graph Theory and is able to apply them to real life problems and situations. He can implement and test classical algorithms of graph theory, such as Euler’s circuit, Disjkstra’s shortest path, Welsh-Powell’s coloring, etc.

Bibliography

• Olivier Carton, Langages formels, calculabilité et complexité, Vuibert, 2008 (ISBN 978-2-7117-2077-4)
• Hopcroft, John E.; Motwani, Rajeev; Ullman, Jeffrey D. (2013). Introduction to Automata Theory, Languages, and Computation(3rd ed.). Pearson. ISBN 1292039051.
• Ferdinand Wagner, Ruedi Schmuki, Thomas Wagner et Peter Wolstenholme, Modeling Software with Finite State Machines : A Practical Approach, Auerbach Publications, 2006, 392 p. (ISBN 9780849380860).
* Gondran, Michel, and Michel Minoux. Graphs and algorithms. Wiley, 1984

Organization

Contact(s)

MORIN GÉRALDINE

Contact

The National Institute of Electrical engineering, Electronics, Computer science,Fluid mechanics & Telecommunications and Networks

2, rue Charles Camichel - BP 7122
31071 Toulouse Cedex 7, France

+33 (0)5 34 32 20 00

Certifications

  • Logo MENESR
  • Logo UTFTMP
  • Logo INP
  • Logo INPT
  • Logo Mines télécoms
  • Logo CTI
  • Logo CDEFI
  • Logo midisup