Notes for the Course Formal Languages and Automata Theory (TDDD 14)

1. Basic Concepts
2. Finite Automata
3. Regular Expressions and Minimization of DFA's
   Alternative solutions for 3.5, using GNFA construction
4. Regular Languages
5. Context-Free Grammars
6. Regular grammars, PDA's, and Properties of CFL's
7. LR-Grammars
8. Turing Machines