🔗 project 1  🔗 project 2   🔗 NOTES 



Session / Timeline  Tutorial / Oral exam  Idea / Concept  Video 
none  none  🔗 Motivation  
   
1 & 2  🔗 TD 1  Automaton  
→ 🔗 Introduction to languages  
→ 🔗 Regular expressions  🔗 
→ 🔗 Deterministic finite automaton  🔗 
→ 🔗Indeterministic finite automaton  🔗 
→ 🔗 Finite automaton εindeterministic  🔗 
→ 🔗 Thompson's construction  🔗 
→ 🔗 Construction of Gloushkov  
→ 🔗 Lemma of Arden  🔗 
→ 🔗 Brzozowski and McCluskey  
   
3 & 4  🔗 TD 2  Automaton reduction  
→ 🔗 Types of grammars  
→ 🔗 Deterministic finite automaton  
→ 🔗 Indeterministic finite automaton  
→ 🔗 Finite automaton εindeterministic  
→ 🔗 Determination of an NFA  🔗 
→ 🔗 Determinization of an εNFA  🔗 
 🔗 
→ 🔗 Minimization of an AFD  

5  🔗 TD 3  Battery operated automaton  
→ 🔗 Introduction to batterypowered PLCs  🔗 
End of project 1   🔗 

6 & 7  🔗 TD4  Discrete time markov chain  
→ 🔗 Stochastic process  🔗 
→ 🔗 Definition of states 
→ Definition of classes 
→ 🔗 Stationary probability  🔗 
→ Period  
→ 🔗 Time to reach a state  🔗 
→ Back  🔗 
→ 🔗 Absorption  
   
8  🔗 TD5  Continuoustime markov chain  
→ 🔗 General  
→ 🔗 Permanent regime  
→ 🔗 Poisson process  
→ 🔗 Queue  🔗 
→ 🔗 File M / M / 1  🔗 
End of project 2  



REFERENCES 
Introduction to Algorithms: Cormen, T and Leiserson, C 
The Algorithm Design Manual: Steven S. Skiena 
Electric Power System Applications of Optimization, Second Edition: James A. Momoh 