Automata Theory and Formal Languages

Plan of classes:

  1. Relations (8.X.2021)
  2. Relation induced by language (15.X.2021)
  3. Regular expressions (22.X.2021)
  4. Regular languages (29.X.2021)
  5. Context-free grammars, useless symbols and productions (05.XI.2021)
  6. Context-free grammars, normal forms (19.XI.2021)
  7. First Test
  8. Tuning machines
  9. Multitape Tuning machines
  10. Nondeterministic Tuning Machines
  11. Linear bounded automaton
  12. Finite automata
  13. Types of finite automata

Resources: