| 🔗 Project | ||
| Session | Reading | Idea / Concept |
| 1 | 🔗 Reading 1 | Basics |
|     → Probability | ||
|     → Random variable | ||
|     → Markov chain discrete time order 1 | ||
|     → Theorem ergodic | ||
|     → Absorption | ||
|     → Study of a chain | ||
| 2 | 🔗 Reading 2 | Hidden Markov Chain |
|     → Definitions | ||
|     → Backward-Forward | ||
|     → Viterbi | ||
|     → Baum-Welch | ||
|     → sklearn | ||
| 3 | 🔗 Reading 3 | Probabilistic automaton |
|     → Automaton probabilistic | ||
|     → Frequency automaton | ||
|     → HMMT | ||
|     → Merge & Fold | ||
|     → Forbidden words | ||
|     → ALERGIA | ||
| Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â REFERENCES | ||
| Introduction to Algorithms: Cormen, T and Leiserson, C | ||
| The Algorithm Design Manual: Steven S. Skiena | ||
| Grammatical Inference: Learning Automata and Grammars: C. de la Higuera | ||