Theory of Computation
2025/2026 Q2
This page collects some material used for the Theory of Computation (Teoria de la Computació, TC) course group 11 which is not (yet) in the main page of the course. In particular, below there are theory bits on some selected topics of the course.
- From DFAs/NFAs to regular expressions (Arden’s rule)
- The pumping lemma for context-free languages
- Depuration of context-free grammars
Caution
The slides below are just provided as a visual reminder of what seen in class. They do not even cover the material seen using the blackboard! To study please use the resources (books/videos) provided in the main page of the course!
The style of the first two classes has been updated to match the rest of the slides.